This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A006701 Exponentiation of g.f. for Fibonacci numbers. 2
 0, 1, 1, 5, 13, 60, 246, 1266, 6679, 39568, 247940, 1677435, 12020295, 91463410, 733490265, 6189608760, 54746987035, 506444804075, 4887127598817, 49096724251235, 512474550910080, 5548429401985372, 62208756548406172, 721256031012180537, 8635815672831322186 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,4 LINKS FORMULA a(-1) = 1, a(n) = Sum_{k=0..n} binomial(n, k) * A000045(k) * a(n-k-1). - Sean A. Irvine, Jun 11 2017 PROG (PARI) a(n) = if (n==-1, 1, sum(k=0, n, binomial(n, k)*fibonacci(k)*a(n-k-1))); \\ Michel Marcus, Jun 11 2017 CROSSREFS Cf. A000045, A007552, A256180. Sequence in context: A149566 A298066 A298715 * A071699 A096639 A092773 Adjacent sequences:  A006698 A006699 A006700 * A006702 A006703 A006704 KEYWORD nonn AUTHOR STATUS approved

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

Last modified April 22 08:56 EDT 2019. Contains 322329 sequences. (Running on oeis4.)