login
This site is supported by donations 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. 0
1, 1, 2, 4, 8, 18, 52, 232, 2402, 117668, 88187304, 4976488920530, 304428188114211553556, 1303145665493529877195427353444744, 383170653295945759116409236671895695428812677131461090 (list; graph; refs; listen; history; internal format)
OFFSET

1,3

COMMENTS

Conjecture: limit n->infinity Phi^(Phi^(n-c))/a(n) = 1 where c is a constant = 3.47348961175710091....

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

Cf. A000045 A001622.

Sequence in context: A034766 A099785 A166952 * A116723 A180206 A058374

Adjacent sequences:  A135419 A135420 A135421 * A135423 A135424 A135425

KEYWORD

nonn

AUTHOR

Gerald McGarvey (gerald.mcgarvey(AT)comcast.net), Dec 12 2007

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 14 06:53 EST 2012. Contains 205577 sequences.