login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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 (list; graph; refs; listen; history; text; internal format)
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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 04:14 EDT 2024. Contains 371918 sequences. (Running on oeis4.)