login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A120614 a(n)=g(n)-g(n-1) where g(k)=floor(phi*floor(k/phi)) and phi=(1+sqrt(5))/2. 2
0, 1, 0, 2, 1, 0, 2, 0, 2, 1, 0, 2, 1, 0, 2, 0, 2, 1, 0, 2, 0, 2, 1, 0, 2, 1, 0, 2, 0, 2, 1, 0, 2, 1, 0, 2, 0, 2, 1, 0, 2, 0, 2, 1, 0, 2, 1, 0, 2, 0, 2, 1, 0, 2, 0, 2, 1, 0, 2, 1, 0, 2, 0, 2, 1, 0, 2, 1, 0, 2, 0, 2, 1, 0, 2, 0, 2, 1, 0, 2, 1, 0, 2, 0, 2, 1, 0, 2, 1, 0, 2, 0, 2, 1, 0, 2, 0, 2, 1, 0, 2, 1, 0, 2, 0 (list; graph; refs; listen; history; internal format)
OFFSET

1,4

FORMULA

a(floor(k*phi)+k+1)=0 ; a(floor(k*phi)+k+2)=2, if n is not in {floor(k*phi)+k+1}U{floor(k*phi)+k+2}_{k>=1} a(n)=1

The word obtained after deleting the initial string {0,1}, 0210202102102021020..., is a fixed point of the morphism 02-->10202 and 102-->10210202

CROSSREFS

Cf. A120613, A120615.

Sequence in context: A194313 A127476 A140397 * A097567 A022881 A093201

Adjacent sequences:  A120611 A120612 A120613 * A120615 A120616 A120617

KEYWORD

nonn

AUTHOR

Benoit Cloitre (abmt(AT)orange.fr), Jun 17 2006

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 16 03:44 EST 2012. Contains 205860 sequences.