Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A089650
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A089650 a(n)=A089649(n) (mod 3). +0
2
1, 2, 0, 1, 0, 2, 1, 1, 1, 1, 2, 0, 1, 1, 1, 1, 0, 2, 1, 2, 0, 1, 2, 0, 1, 2, 0, 1, 2, 0, 1, 0, 2, 1, 1, 1, 1, 2, 0, 1, 2, 0, 1, 2, 0, 1, 2, 0, 1, 1, 1, 1, 0, 2, 1, 2, 0, 1, 0, 2, 1, 1, 1, 1, 2, 0, 1, 0, 2, 1, 1, 1, 1, 2, 0, 1, 0, 2, 1, 1, 1, 1, 2, 0, 1, 0, 2, 1, 1, 1, 1, 2, 0, 1, 1, 1, 1, 0, 2, 1, 2, 0, 1, 2, 0 (list; graph; listen)
OFFSET

1,2

COMMENT

Partial sums, modulo 3, of the sequence : a(1)=1, a(1), a(1), a(1), a(2), a(2), a(2), a(3), a(3), ... each term repeated 3 times.

FORMULA

A fixed point of the morphism 1->120, 2->102, 0->111.

MATHEMATICA

Nest[ Function[ l, {Flatten[(l /. {0 -> {1, 1, 1}, 1 -> {1, 2, 0}, 2 -> {1, 0, 2}})]}], {0}, 5] (from Robert G. Wilson v Feb 26 2005)

PROGRAM

(PARI) a(n)=if(n<2, 1, (a(n-1)+a(floor((n+1)/3)))%3)

CROSSREFS

Sequence in context: A127505 A138036 A086372 this_sequence A085513 A117054 A036579

Adjacent sequences: A089647 A089648 A089649 this_sequence A089651 A089652 A089653

KEYWORD

easy,nonn

AUTHOR

DELEHAM Philippe (kolotoko(AT)wanadoo.fr), Jan 02 2004

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 14:49 EST 2009. Contains 167514 sequences.


AT&T Labs Research