%I #10 Mar 19 2024 08:30:04
%S 0,0,0,1,0,2,0,3,0,4,0,5,0,0,1,0,1,1,0,2,1,0,3,1,0,4,1,0,5,1,0,0,2,0,
%T 1,2,0,2,2,0,3,2,0,4,2,0,5,2,0,0,3,0,1,3,0,2,3,0,3,3,0,4,3,0,5,3,0,0,
%U 4,0,1,4,0,2,4,0,3,4,0,4,4,0,5,4,0,0,5,0,1,5,0,2,5,0,3,5,0,4,5,0,5,5,0,0,0
%N Let S_n = 0 followed by base-6 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 6.
%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="/A234581/b234581.txt">Table of n, a(n) for n = 0..10001</a>
%p See A234577.
%t Flatten[Array[{0, Reverse[IntegerDigits[#, 6]]} &, 50, 0]] (* _Paolo Xausa_, Mar 19 2024 *)
%Y Cf. A007092, A234577-A234580, A234582-A234585.
%K nonn,base
%O 0,6
%A _N. J. A. Sloane_, Dec 29 2013