|
Search: id:A107604
|
|
|
| A107604 |
|
Order of appearance of twos in the Fibonacci substitution :triangular in form. |
|
+0
1
|
|
| 2, 2, 2, 2, 5, 2, 5, 2, 5, 7, 2, 5, 7, 2, 5, 7, 2, 5, 7, 10, 2, 5, 7, 10, 2, 5, 7, 10, 2, 5, 7, 10, 13, 2, 5, 7, 10, 13, 2, 5, 7, 10, 13, 15, 2, 5, 7, 10, 13, 15, 2, 5, 7, 10, 13, 15, 2, 5, 7, 10, 13, 15, 18, 2, 5, 7, 10, 13, 15, 18, 2, 5, 7, 10, 13, 15, 18, 20
(list; table; graph; listen)
|
|
|
OFFSET
|
0,1
|
|
|
COMMENT
|
Fibonacci substitutions contain thrre types of informstion: 1) length 2) count of ones and twos 3) order of appearance of ones and twos
|
|
FORMULA
|
1->{1, 2}, 2->{1}
|
|
EXAMPLE
|
{}
2,
2,
2,
2,5,
2,5,
2,5,7,
2,5,7,
2,5,7,
2,5,7,10,
2,5,7,10,
2,5,7,10,
2,5,7,10,13
|
|
MATHEMATICA
|
s[1] = {1, 2}; s[2] = {1}; ; t[a_] := Flatten[s /@ a]; p[0] = {1}; p[1] = t[p[0]]; p[n_] := t[p[n - 1]] a = Table[Flatten[Table[If[p[i][[j]] == 2, j, {}], {j, 1, i}]], {i, 1, 20}]
|
|
CROSSREFS
|
Cf. A000045.
Adjacent sequences: A107601 A107602 A107603 this_sequence A107605 A107606 A107607
Sequence in context: A066180 A123487 A130325 this_sequence A080647 A118486 A141299
|
|
KEYWORD
|
nonn,uned,tabl
|
|
AUTHOR
|
Roger L. Bagula (rlbagulatftn(AT)yahoo.com), Jun 09 2005
|
|
|
Search completed in 0.002 seconds
|
