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”).

A135422
a(1) = 1, a(n) = Sum(k=1,n-1, a(k)^F(n-k)) where F(m) is the m-th Fibonacci number.
1
1, 1, 2, 4, 8, 18, 52, 232, 2402, 117668, 88187304, 4976488920530, 304428188114211553556, 1303145665493529877195427353444744, 383170653295945759116409236671895695428812677131461090
OFFSET
1,3
COMMENTS
Conjecture: limit n->infinity Phi^(Phi^(n-c))/a(n) = 1 where c is a constant = 3.47348961175710091....
LINKS
MATHEMATICA
a[1]:= 1; a[n_] := Sum[a[k]^Fibonacci[n - k], {k, 1, n - 1}]; Join[{1}, Table[a[n], {n, 2, 10}]] (* G. C. Greubel, Oct 13 2016 *)
PROG
(PARI) a=vector(16); a[1]=1; print1("1, "); for(n=2, 16, a[n]=sum(k=1, n-1, a[k]^fibonacci(n-k)); print1(a[n], ", "))
CROSSREFS
Sequence in context: A333497 A367115 A166952 * A116723 A323020 A180206
KEYWORD
nonn
AUTHOR
Gerald McGarvey, Dec 12 2007
STATUS
approved