|
Search: id:A005713
|
|
|
| A005713 |
|
Define strings S(0)=0, S(1)=11, S(n) = S(n-1)S(n-2); iterate. |
|
+0
2
|
|
| 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1
(list; graph; listen)
|
|
|
OFFSET
|
0,1
|
|
|
FORMULA
|
For n>1, a(n-1)=floor(phi*ceiling(n/phi))-ceiling(phi*floor(n/phi)) where phi=(1+sqrt(5))/2. For n>=0, a(n)=abs(A005713(n+1)). - Benoit Cloitre (benoit7848c(AT)orange.fr), Apr 21 2003
|
|
EXAMPLE
|
The infinite word is S(infinity) = 110111101101111011110110...
|
|
PROGRAM
|
(PARI) a(n, f1, f2)=local(f3); for(i=3, n, f3=concat(f2, f1); f1=f2; f2=f3); f2
(PARI) printp(a(10, [ 0 ], [ 1, 1 ])) \\ Would give S(10). Sequence is S(infinity).
|
|
CROSSREFS
|
Cf. A005614, A003849.
Sequence in context: A118828 A071034 A105234 this_sequence A085241 A105368 A138019
Adjacent sequences: A005710 A005711 A005712 this_sequence A005714 A005715 A005716
|
|
KEYWORD
|
nonn,easy,nice
|
|
AUTHOR
|
njas
|
|
EXTENSIONS
|
Corrected by Michael Somos
|
|
|
Search completed in 0.002 seconds
|
