|
Search: id:A135422
|
|
|
| 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. |
|
+0
1
|
|
| 1, 1, 2, 4, 8, 18, 52, 232, 2402, 117668, 88187304, 4976488920530, 304428188114211553556, 1303145665493529877195427353444744, 383170653295945759116409236671895695428812677131461090
(list; graph; listen)
|
|
|
OFFSET
|
1,3
|
|
|
COMMENT
|
Conjecture: limit n->infinity Phi^(Phi^(n-c))/a(n) = 1 where c is a constant = 3.47348961175710091....
|
|
PROGRAM
|
(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
|
Cf. A000045 A001622.
Sequence in context: A034766 A099785 A166952 this_sequence A116723 A058374 A007881
Adjacent sequences: A135419 A135420 A135421 this_sequence A135423 A135424 A135425
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Gerald McGarvey (gerald.mcgarvey(AT)comcast.net), Dec 12 2007
|
|
|
Search completed in 0.002 seconds
|
