%I
%S 0,0,0,1,0,0,1,0,1,1,0,0,0,1,0,1,0,1,0,0,1,1,0,1,1,1,0,0,0,0,1,0,1,0,
%T 0,1,0,0,1,0,1,0,1,1,0,1,0,0,0,1,1,0,1,0,1,1,0,0,1,1,1,0,1,1,1,1,0,0,
%U 0,0,0,1,0,1,0,0,0,1,0,0,1,0,0,1,0,1,1,0,0,1,0,0,0,1,0,1,0,1,0,1,0,1,0,0,1
%N Let S_n = 0 followed by base2 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 2.
%D Crandall, Richard; Pomerance, Carl. Prime numbers. A computational perspective. SpringerVerlag, New York, 2001. xvi+545 pp. ISBN: 0387947779 MR1821158 (2002a:11007). See pp. 373374.
%p b:=2;
%p S:=[0,0];
%p for n from 1 to 50 do
%p t1:=convert(n,base,b);
%p S:=[op(S),0,op(t1)];
%p od:
%p S;
%Y Cf. A234577A234585.
%K nonn,base
%O 0
%A _N. J. A. Sloane_, Dec 29 2013
