The On-Line Encyclopedia of Integer Sequences (OEIS)

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

A004757

Binary expansion starts 101.
(history; published version)

#29 by Michel Marcus at Thu Jul 14 02:36:17 EDT 2022

STATUS

reviewed

approved

#28 by Joerg Arndt at Thu Jul 14 02:34:55 EDT 2022

STATUS

proposed

reviewed

#27 by Joerg Arndt at Thu Jul 14 02:34:52 EDT 2022

STATUS

editing

proposed

#26 by Joerg Arndt at Thu Jul 14 02:34:50 EDT 2022

KEYWORD

nonn,base,easy,changed

STATUS

proposed

editing

#25 by Chai Wah Wu at Wed Jul 13 17:52:06 EDT 2022

STATUS

editing

proposed

Discussion

Wed Jul 13

18:05

Michel Marcus: base ?

#24 by Chai Wah Wu at Wed Jul 13 17:52:03 EDT 2022

PROG

(Python)

def A004757(n): return n+(2<<n.bit_length()) # Chai Wah Wu, Jul 13 2022

STATUS

approved

editing

#23 by Susanna Cuyler at Mon Oct 15 22:09:57 EDT 2018

STATUS

proposed

approved

#22 by Jon E. Schoenfield at Mon Oct 15 15:41:50 EDT 2018

STATUS

editing

proposed

#21 by Jon E. Schoenfield at Mon Oct 15 15:41:46 EDT 2018

FORMULA

a(2n) = 2a(n), a(2n+1) = 2a(n) + 1 + 4*[n==0].

a(n) = n + 4 * 2^floor(log2log_2(n)) = A004756(n) + A053644(n).

AUTHOR

N. J. A. Sloane.

STATUS

approved

editing

#20 by Harvey P. Dale at Fri Aug 26 18:22:14 EDT 2016

STATUS

editing

approved