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

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A014337 Three-fold exponential convolution of Fibonacci numbers with themselves (divided by 6). 3
 0, 0, 0, 1, 6, 35, 180, 910, 4494, 22049, 107580, 523765, 2546280, 12370436, 60074196, 291677905, 1416019290, 6873991055, 33368325084, 161976597634, 786259649010, 3816607413905, 18526261416960 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,5 LINKS Vincenzo Librandi, Table of n, a(n) for n = 0..1000 Index entries for linear recurrences with constant coefficients, signature (6,-1,-24,9). FORMULA a(n) = (1/30)(3^n*Fibonacci(n) - 3*Fibonacci(2n)). - Ralf Stephan, May 14 2004 G.f.: x^3/((1-3*x+x^2)*(1-3*x-9*x^2)). - Colin Barker, Mar 19 2012 MATHEMATICA CoefficientList[Series[x^3/((1-3*x+x^2)*(1-3*x-9*x^2)), {x, 0, 30}], x] (* Vincenzo Librandi, Mar 20 2012 *) PROG (PARI) a(n)=(3^n*fibonacci(n)-3*fibonacci(2*n))/30 \\ Charles R Greathouse IV, Mar 20 2012 CROSSREFS Cf. A014336. Column k=3 of A346415. Sequence in context: A030532 A333800 A026997 * A002041 A103995 A137628 Adjacent sequences: A014334 A014335 A014336 * A014338 A014339 A014340 KEYWORD nonn,easy AUTHOR N. J. A. Sloane. 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 December 11 14:52 EST 2023. Contains 367727 sequences. (Running on oeis4.)