[go: up one dir, main page]

login
A234584
Let S_n = 0 followed by base-9 expansion of n, reversed; sequence is concatenation of S_0, S_1, S_2, ...
2
0, 0, 0, 1, 0, 2, 0, 3, 0, 4, 0, 5, 0, 6, 0, 7, 0, 8, 0, 0, 1, 0, 1, 1, 0, 2, 1, 0, 3, 1, 0, 4, 1, 0, 5, 1, 0, 6, 1, 0, 7, 1, 0, 8, 1, 0, 0, 2, 0, 1, 2, 0, 2, 2, 0, 3, 2, 0, 4, 2, 0, 5, 2, 0, 6, 2, 0, 7, 2, 0, 8, 2, 0, 0, 3, 0, 1, 3, 0, 2, 3, 0, 3, 3, 0, 4, 3, 0, 5, 3, 0, 6, 3, 0, 7, 3, 0, 8, 3, 0, 0, 4, 0, 1, 4
OFFSET
0,6
COMMENTS
This is a version of the van der Corput sequence in base 9.
REFERENCES
Richard Crandall and Carl Pomerance, 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
See A234577.
MATHEMATICA
Flatten[Array[{0, Reverse[IntegerDigits[#, 9]]} &, 50, 0]] (* Paolo Xausa, Mar 19 2024 *)
CROSSREFS
KEYWORD
nonn,base
AUTHOR
N. J. A. Sloane, Dec 29 2013
STATUS
approved