[go: up one dir, main page]

login
A214317
a(n) = length-n prefix of the Fibonacci word A003842.
3
1, 12, 121, 1211, 12112, 121121, 1211212, 12112121, 121121211, 1211212112, 12112121121, 121121211211, 1211212112112, 12112121121121, 121121211211212, 1211212112112121, 12112121121121211, 121121211211212112, 1211212112112121121, 12112121121121211212
OFFSET
1,2
LINKS
MAPLE
S:= proc(n) option remember;
`if`(n<2, [2-n], [S(n-1)[], S(n-2)[]])
end:
a:= proc(n) local k;
for k while nops(S(k))<n do od;
parse(cat(S(k)[1..n][]))
end;
seq(a(n), n=1..30); # Alois P. Heinz, Jul 19 2012
MATHEMATICA
S = SubstitutionSystem[{1 -> {1, 2}, 2 -> {1}}, {1}, 20];
FromDigits[Take[#[[1]], #[[2]]]]& /@ Transpose[{S, Range[Length[S]]}] (* Jean-François Alcover, Nov 07 2020 *)
CROSSREFS
Sequence in context: A176779 A098297 A037543 * A037487 A332603 A358615
KEYWORD
nonn
AUTHOR
N. J. A. Sloane, Jul 12 2012
STATUS
approved