%I A030190
%S A030190 0,1,1,0,1,1,1,0,0,1,0,1,1,1,0,1,1,1,1,0,0,0,1,0,0,1,1,0,1,0,1,0,1,1,1,
%T A030190 1,0,0,1,1,0,1,1,1,1,0,1,1,1,1,1,0,0,0,0,1,0,0,0,1,1,0,0,1,0,1,0,0,1,1,
%U A030190 1,0,1,0,0,1,0,1,0,1,1,0,1,1,0,1,0,1,1,1,1,1,0,0,0,1,1,0,0,1,1,1,0,1,0
%N A030190 Champernowne sequence (or word): write n in base 2 and juxtapose.
%D A030190 J. Berstel and J. Karhumaki, Combinatorics on words - a tutorial, Bull. 
               EATCS, #79 (2003), pp. 178-228.
%D A030190 S. Ferenczi, Complexity of sequences and dynamical systems, Discrete 
               Math., 206 (1999), 145-154.
%H A030190 Jean Berstel, <a href="http://www-igm.univ-mlv.fr/~berstel/">Home Page</
               a>
%H A030190 Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/
               ChampernowneConstant.html">Champernowne Constant</a>
%H A030190 Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/
               NormalNumber.html">Normal Number</a>
%H A030190 Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/
               Binary.html">Binary</a>
%t A030190 Flatten[ Table[ IntegerDigits[n, 2], {n, 0, 26}]] (from Robert G. Wilson 
               v Mar 08 2005)
%Y A030190 Cf. A007376, A003137. Same as and more fundamental than A030302, but 
               I have left A030302 in the table because there are several sequences 
               that are based on it (A030303 etc.). - N. J. A. Sloane (njas(AT)research.att.com).
%Y A030190 a(n) = T(A030530(n), A083652(A030530(n))-n-1), T as defined in A083651, 
               a(A083652(k))=1.
%Y A030190 Sequence in context: A022933 A163532 A014578 this_sequence A157658 A123506 
               A051105
%Y A030190 Adjacent sequences: A030187 A030188 A030189 this_sequence A030191 A030192 
               A030193
%K A030190 nonn,base
%O A030190 0,1
%A A030190 Clark Kimberling (ck6(AT)evansville.edu)