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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A105804 a(n)=F(n-1)a(n-1)+F(n)a(n-2), where F = A000045 (Fibonacci numbers), a(0)=0, a(1)=1. 0
 0, 1, 1, 3, 9, 42, 282, 2802, 42348, 984576, 35804724, 2056887084, 188218830732, 27582766315980, 6497743050809304, 2466474617607855408, 1510962789131940581928, 1495259232837545099449512, 2391833322688676458284572616, 6186748984680033744268134049416 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,4 LINKS Table of n, a(n) for n=0..19. FORMULA a(n) ~ c * ((1+sqrt(5))/2)^(n*(n-1)/2) / 5^(n/2), where c = 49.6023707313141860163673593923904868464364654572509980004... . - Vaclav Kotesovec, Nov 27 2015 MATHEMATICA RecurrenceTable[{a[0]==0, a[1]==1, a[n]==Fibonacci[n-1]a[n-1]+ Fibonacci[ n] a[n-2]}, a, {n, 20}] (* Harvey P. Dale, Apr 25 2014 *) CROSSREFS Cf. A096655. Sequence in context: A018995 A018965 A357703 * A009402 A009584 A013562 Adjacent sequences: A105801 A105802 A105803 * A105805 A105806 A105807 KEYWORD nonn AUTHOR Clark Kimberling, Apr 20 2005 EXTENSIONS Corrected and extended by Harvey P. Dale, Apr 25 2014 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.

Last modified July 13 21:44 EDT 2024. Contains 374288 sequences. (Running on oeis4.)