|
Search: id:A030190
|
|
|
| A030190 |
|
Champernowne sequence (or word): write n in base 2 and juxtapose. |
|
+0
17
|
|
| 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, 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, 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
(list; graph; listen)
|
|
|
OFFSET
|
0,1
|
|
|
REFERENCES
|
J. Berstel and J. Karhumaki, Combinatorics on words - a tutorial, Bull. EATCS, #79 (2003), pp. 178-228.
S. Ferenczi, Complexity of sequences and dynamical systems, Discrete Math., 206 (1999), 145-154.
|
|
LINKS
|
Jean Berstel, Home Page
Eric Weisstein's World of Mathematics, Champernowne Constant
Eric Weisstein's World of Mathematics, Normal Number
Eric Weisstein's World of Mathematics, Binary
|
|
MATHEMATICA
|
Flatten[ Table[ IntegerDigits[n, 2], {n, 0, 26}]] (from Robert G. Wilson v Mar 08 2005)
|
|
CROSSREFS
|
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.). - njas
a(n) = T(A030530(n), A083652(A030530(n))-n-1), T as defined in A083651, a(A083652(k))=1.
Adjacent sequences: A030187 A030188 A030189 this_sequence A030191 A030192 A030193
Sequence in context: A000494 A022933 A014578 this_sequence A123506 A051105 A105565
|
|
KEYWORD
|
nonn,base
|
|
AUTHOR
|
Clark Kimberling (ck6(AT)evansville.edu)
|
|
|
Search completed in 0.002 seconds
|
