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