Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A120614
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A120614 a(n)=g(n)-g(n-1) where g(k)=floor(phi*floor(k/phi)) and phi=(1+sqrt(5))/2. +0
3
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; listen)
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.

Adjacent sequences: A120611 A120612 A120613 this_sequence A120615 A120616 A120617

Sequence in context: A065675 A127476 A140397 this_sequence A097567 A022881 A093201

KEYWORD

nonn

AUTHOR

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

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 October 7 14:39 EDT 2008. Contains 144666 sequences.


AT&T Labs Research