|
|
A234579
|
|
Let S_n = 0 followed by base-4 expansion of n, reversed; sequence is concatenation of S_0, S_1, S_2, ...
|
|
2
|
|
|
0, 0, 0, 1, 0, 2, 0, 3, 0, 0, 1, 0, 1, 1, 0, 2, 1, 0, 3, 1, 0, 0, 2, 0, 1, 2, 0, 2, 2, 0, 3, 2, 0, 0, 3, 0, 1, 3, 0, 2, 3, 0, 3, 3, 0, 0, 0, 1, 0, 1, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 0, 1, 1, 0, 1, 1, 1, 0, 2, 1, 1, 0, 3, 1, 1, 0, 0, 2, 1, 0, 1, 2, 1, 0, 2, 2, 1, 0, 3, 2, 1, 0, 0, 3, 1, 0, 1, 3, 1, 0, 2, 3, 1, 0
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,6
|
|
COMMENTS
|
This is a version of the van der Corput sequence in base 4.
|
|
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.
|
|
LINKS
|
|
|
MAPLE
|
|
|
MATHEMATICA
|
Flatten[Array[{0, Reverse[IntegerDigits[#, 4]]} &, 50, 0]] (* Paolo Xausa, Mar 19 2024 *)
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,base
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|