The On-Line Encyclopedia of Integer Sequences (OEIS)

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

A062383

a(0) = 1: for n>0, a(n) = 2^floor(log_2(n)+1) or a(n) = 2*a(floor(n/2)).
(history; published version)

#104 by Alois P. Heinz at Thu Jun 20 08:00:15 EDT 2024

STATUS

proposed

approved

#103 by Andrey Zabolotskiy at Thu Jun 20 07:49:53 EDT 2024

STATUS

editing

proposed

#102 by Andrey Zabolotskiy at Thu Jun 20 07:46:40 EDT 2024

COMMENTS

Informally, write down 1 followed by 2^k 2^(k-1) times, for k = 1,2,3,4,... These are the denominators of the binary van der Corput sequence (see A030101 for the numerators). - N. J. A. Sloane, Dec 01 2019

#101 by Andrey Zabolotskiy at Thu Jun 20 07:43:04 EDT 2024

COMMENTS

Informally, write down 1 followed by 2^k 2^(k-1) times, for k = 1,2,3,4,... These are the denominators of the van der Corput sequence (see A030109A030101). - N. J. A. Sloane, Dec 01 2019

CROSSREFS

Cf. A030109, A030101, A264618, A264619.

STATUS

approved

editing

#100 by Michael De Vlieger at Fri Jul 01 09:40:35 EDT 2022

STATUS

reviewed

approved

#99 by Michel Marcus at Fri Jul 01 01:31:14 EDT 2022

STATUS

proposed

reviewed

#98 by Jon E. Schoenfield at Thu Jun 30 20:46:21 EDT 2022

STATUS

editing

proposed

Discussion

Fri Jul 01

01:31

Michel Marcus: trick: search program:branicky, copy the 2nd one, and adapt

#97 by Jon E. Schoenfield at Thu Jun 30 20:46:18 EDT 2022

PROG

(MAGMAMagma) [2^Floor(Log(2, 2*n+1)): n in [0..70]]; // Bruno Berselli, Mar 04 2016

STATUS

proposed

editing

#96 by Chai Wah Wu at Thu Jun 30 14:13:45 EDT 2022

STATUS

editing

proposed

#95 by Chai Wah Wu at Thu Jun 30 14:13:13 EDT 2022

PROG

def A062383(n): return 1 if n == 0 else 1 << n.bit_length() # Chai Wah Wu, Jun 30 2022

STATUS

proposed

editing