The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A000523

(Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing entries 1-10 | older changes

A000523

a(n) = floor(log_2(n)).
(history; published version)

#200 by Michael De Vlieger at Fri Jul 19 20:58:20 EDT 2024

STATUS

reviewed

approved

#199 by Stefano Spezia at Fri Jul 19 13:43:34 EDT 2024

STATUS

proposed

reviewed

#198 by Amiram Eldar at Fri Jul 19 13:04:56 EDT 2024

STATUS

editing

proposed

#197 by Amiram Eldar at Fri Jul 19 13:04:52 EDT 2024

FORMULA

a(n) = floor(Sum_{k=1..n-1} (n+1)^(n-2^k)) mod n. -_ _Joseph M. Shunia_, Jul 19 2024

STATUS

proposed

editing

#196 by Joseph M. Shunia at Fri Jul 19 12:54:53 EDT 2024

STATUS

editing

proposed

#195 by Joseph M. Shunia at Fri Jul 19 12:46:52 EDT 2024

FORMULA

a(n) = floor(Sum_{k=1..n-1} (n+1)^(n-2^k)) mod n. -Joseph M. Shunia, Jul 19 2024

STATUS

approved

editing

#194 by Michael De Vlieger at Tue Apr 18 14:45:46 EDT 2023

STATUS

reviewed

approved

#193 by Michel Marcus at Tue Apr 18 12:36:51 EDT 2023

STATUS

proposed

reviewed

#192 by Michael S. Branicky at Tue Apr 18 12:24:27 EDT 2023

STATUS

editing

proposed

#191 by Michael S. Branicky at Tue Apr 18 12:24:25 EDT 2023

PROG

(Python)

def a(n): return n.bit_length() - 1

print([a(n) for n in range(1, 106)]) # Michael S. Branicky, Apr 18 2023

STATUS

approved

editing