|
Search: id:A036577
|
|
|
| A036577 |
|
Ternary Thue-Morse sequence: closed under a->abc, b->ac, c->b. |
|
+0
7
|
|
| 2, 1, 0, 2, 0, 1, 2, 1, 0, 1, 2, 0, 2, 1, 0, 2, 0, 1, 2, 0, 2, 1, 0, 1, 2, 1, 0, 2, 0, 1, 2, 1, 0, 1, 2, 0, 2, 1, 0, 1, 2, 1, 0, 2, 0, 1, 2, 0, 2, 1, 0, 2, 0, 1, 2, 1, 0, 1, 2, 0, 2, 1, 0, 2, 0, 1, 2, 0, 2, 1, 0, 1, 2, 1, 0, 2, 0, 1, 2, 0, 2, 1, 0, 2, 0, 1, 2, 1, 0, 1, 2, 0, 2, 1, 0, 1, 2, 1, 0, 2, 0, 1, 2, 1, 0
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
REFERENCES
|
M. Lothaire, Combinatorics on Words. Addison-Wesley, Reading, MA, 1983, p. 26.
|
|
LINKS
|
J.-P. Allouche and J. O. Shallit, The Ubiquitous Prouhet-Thue-Morse Sequence, in C. Ding. T. Helleseth and H. Niederreiter, eds., Sequences and Their Applications: Proceedings of SETA '98, Springer-Verlag, 1999, pp. 1-16.
|
|
FORMULA
|
a(n) = 3 - A007413(n) . a(A036554(n)) = 1; a(A091785(n)) = 0; a(A091855(n)) = 2 . - DELEHAM Philippe (kolotoko(AT)wanadoo.fr), Mar 20 2004
|
|
PROGRAM
|
(PARI) a(n)=if(n<1|valuation(n, 2)%2, 1, 1-(-1)^subst(Pol(binary(n)), x, 1))
|
|
CROSSREFS
|
Number of 1's between successive 0's in A010060.
a(n) = A036585(n) - 1 = A029883(n) + 1.
Sequence in context: A071412 A080884 A091392 this_sequence A035158 A002325 A129134
Adjacent sequences: A036574 A036575 A036576 this_sequence A036578 A036579 A036580
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
njas
|
|
|
Search completed in 0.002 seconds
|
