Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A036585
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A036585 Ternary Thue-Morse sequence: closed under a->abc, b->ac, c->b. +0
9
3, 2, 1, 3, 1, 2, 3, 2, 1, 2, 3, 1, 3, 2, 1, 3, 1, 2, 3, 1, 3, 2, 1, 2, 3, 2, 1, 3, 1, 2, 3, 2, 1, 2, 3, 1, 3, 2, 1, 2, 3, 2, 1, 3, 1, 2, 3, 1, 3, 2, 1, 3, 1, 2, 3, 2, 1, 2, 3, 1, 3, 2, 1, 3, 1, 2, 3, 1, 3, 2, 1, 2, 3, 2, 1, 3, 1, 2, 3, 1, 3, 2, 1, 3, 1, 2, 3, 2, 1, 2, 3, 1, 3, 2, 1, 2, 3, 2, 1, 3, 1, 2, 3, 2, 1 (list; graph; listen)
OFFSET

1,1

COMMENT

First differences of A001969. Observed by Franklin T. Adams-Watters, proved by Max Alekseyev, Aug 30 2006

REFERENCES

M. Lothaire, Combinatorics on Words. Addison-Wesley, Reading, MA, 1983, p. 26.

FORMULA

a(n) = A001969(n+1) - A001969(n). - Frank Adams-Watters (FrankTAW(AT)Netscape.net), Aug 28 2006

PROGRAM

(PARI) a(n)=if(n<1|valuation(n, 2)%2, 2, 2-(-1)^subst(Pol(binary(n)), x, 1))

CROSSREFS

a(n) = A029883(n) + 2 = A036577(n) + 1.

Cf. A001969.

Sequence in context: A085068 A079587 A112745 this_sequence A164848 A130827 A070309

Adjacent sequences: A036582 A036583 A036584 this_sequence A036586 A036587 A036588

KEYWORD

nonn

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research