login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A107638
Order of appearance of ones in the Fibonacci substitution :triangular in form.
0
1, 1, 1, 3, 1, 3, 4, 1, 3, 4, 1, 3, 4, 6, 1, 3, 4, 6, 1, 3, 4, 6, 8, 1, 3, 4, 6, 8, 9, 1, 3, 4, 6, 8, 9, 1, 3, 4, 6, 8, 9, 11, 1, 3, 4, 6, 8, 9, 11, 12, 1, 3, 4, 6, 8, 9, 11, 12, 1, 3, 4, 6, 8, 9, 11, 12, 14, 1, 3, 4, 6, 8, 9, 11, 12, 14, 1, 3, 4, 6, 8, 9, 11, 12, 14, 16, 1, 3, 4, 6, 8, 9, 11, 12, 14
OFFSET
0,4
COMMENTS
Fibonacci substitutions contain three types of information: 1) length 2) count of ones and twos 3) order of appearance of ones and twos
FORMULA
1->{1, 2}, (Correction) 2->{1}
EXAMPLE
1
1
1,3
1,3,4
1,3,4
1,3,4,6
1,3,4,6,
1,3,4,6,8
1,3,4,6,8,9
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]] == 1, j, {}], {j, 1, i}]], {i, 1, 20}]
CROSSREFS
Cf. A000045.
Sequence in context: A030708 A095709 A076152 * A245093 A104765 A308690
KEYWORD
nonn,uned,tabf
AUTHOR
Roger L. Bagula, Jun 09 2005
STATUS
approved