|
| |
|
|
A030190
|
|
Champernowne sequence (or word): write n in base 2 and juxtapose.
|
|
24
| |
|
|
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; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,1
|
|
|
COMMENTS
| a(A003607(n)) = 0 and for n > 0: a(A030303(n)) = 1. [Reinhard Zumkeller, Dec 11 2011]
|
|
|
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
| Reinhard Zumkeller, Table of n, a(n) for n = 0..10000
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)
|
|
|
PROG
| (Haskell)
import Data.List (unfoldr)
a030190 n = a030190_list !! n
a030190_list = 0 : concatMap (reverse . unfoldr
(\x -> if x == 0 then Nothing else Just $ swap $ divMod x 2)) [0..]
-- Reinhard Zumkeller, Dec 11 2011
|
|
|
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.). - N. J. A. Sloane (njas(AT)research.att.com).
a(n) = T(A030530(n), A083652(A030530(n))-n-1), T as defined in A083651, a(A083652(k))=1.
Sequence in context: A022933 A163532 A014578 * A157658 A123506 A051105
Adjacent sequences: A030187 A030188 A030189 * A030191 A030192 A030193
|
|
|
KEYWORD
| nonn,base
|
|
|
AUTHOR
| Clark Kimberling (ck6(AT)evansville.edu)
|
| |
|
|
