|
%I #12 Mar 19 2024 09:26:30
%S 0,0,0,1,0,2,0,3,0,4,0,5,0,6,0,7,0,8,0,9,0,0,1,0,1,1,0,2,1,0,3,1,0,4,
%T 1,0,5,1,0,6,1,0,7,1,0,8,1,0,9,1,0,0,2,0,1,2,0,2,2,0,3,2,0,4,2,0,5,2,
%U 0,6,2,0,7,2,0,8,2,0,9,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
%N Let S_n = 0 followed by base-10 expansion of n, reversed; sequence is concatenation of S_0, S_1, S_2, ...
%C This is a version of the van der Corput sequence in base 10.
%D 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.
%H Paolo Xausa, <a href="/A234585/b234585.txt">Table of n, a(n) for n = 0..10004</a>
%p See A234577.
%t Flatten[Array[{0, Reverse[IntegerDigits[#]]} &, 50, 0]] (* _Paolo Xausa_, Mar 19 2024 *)
%Y Cf. A234577-A234584.
%K nonn,base
%O 0,6
%A _N. J. A. Sloane_, Dec 29 2013
|
