Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A096271
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A096271 Ternary sequence which is a fixed point of the morphism 0 -> 01, 1 -> 02, 2 -> 00. +0
3
0, 1, 0, 2, 0, 1, 0, 0, 0, 1, 0, 2, 0, 1, 0, 1, 0, 1, 0, 2, 0, 1, 0, 0, 0, 1, 0, 2, 0, 1, 0, 2, 0, 1, 0, 2, 0, 1, 0, 0, 0, 1, 0, 2, 0, 1, 0, 1, 0, 1, 0, 2, 0, 1, 0, 0, 0, 1, 0, 2, 0, 1, 0, 0, 0, 1, 0, 2, 0, 1, 0, 0, 0, 1, 0, 2, 0, 1, 0, 1, 0, 1, 0, 2, 0, 1, 0, 0, 0, 1, 0, 2, 0, 1, 0, 2, 0, 1, 0, 2, 0, 1, 0, 0, 0 (list; graph; listen)
OFFSET

0,4

FORMULA

Recurrence: a(2n) = 0, a(2n+1) = (a(n)+1) mod 3. - Ralf Stephan, Dec 11 2004

MATHEMATICA

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

PROGRAM

(PARI) map(d)=if(d==2, [0, 0], if(d==1, [0, 2], [0, 1]))

{m=53; v=[]; w=[0]; while(v!=w, v=w; w=[]; for(n=1, min(m, length(v)), w=concat(w, map(v[n])))); for(n=1, 2*m, print1(v[n], ", "))} - Klaus Brockhaus, Jun 23 2004

CROSSREFS

Cf. A071858.

Sequence in context: A069846 A161520 A070097 this_sequence A034876 A091393 A110270

Adjacent sequences: A096268 A096269 A096270 this_sequence A096272 A096273 A096274

KEYWORD

nonn,easy

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com), Jun 23 2004

EXTENSIONS

More terms from Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), Jun 23 2004

page 1

Search completed in 0.003 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 08:46 EST 2009. Contains 167481 sequences.


AT&T Labs Research