login
A234577
Let S_n = 0 followed by base-2 expansion of n, reversed; sequence is concatenation of S_0, S_1, S_2, ...
9
0, 0, 0, 1, 0, 0, 1, 0, 1, 1, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 1, 1, 0, 1, 1, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 0, 0, 1, 1, 0, 1, 0, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 1, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1
OFFSET
0
COMMENTS
This is a version of the van der Corput sequence in base 2.
REFERENCES
Crandall, Richard; Pomerance, Carl. Prime numbers. A computational perspective. Springer-Verlag, New York, 2001. xvi+545 pp. ISBN: 0-387-94777-9 MR1821158 (2002a:11007). See pp. 373-374.
MAPLE
b:=2;
S:=[0, 0];
for n from 1 to 50 do
t1:=convert(n, base, b);
S:=[op(S), 0, op(t1)];
od:
S;
MATHEMATICA
Flatten[Array[{0, Reverse[IntegerDigits[#, 2]]} &, 50, 0]] (* Paolo Xausa, Mar 19 2024 *)
CROSSREFS
KEYWORD
nonn,base
AUTHOR
N. J. A. Sloane, Dec 29 2013
STATUS
approved