The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A121364 Convolution of A066983 with the double Fibonacci sequence A103609. 0
 0, 0, 1, 2, 3, 6, 10, 18, 29, 50, 81, 136, 220, 364, 589, 966, 1563, 2550, 4126, 6710, 10857, 17622, 28513, 46224, 74792, 121160, 196041, 317434, 513619, 831430, 1345282, 2177322, 3522981, 5701290, 9224881, 14927768, 24153636, 39083988, 63239221, 102327390 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,4 COMMENTS The convolution of 1,0,1,1,1,3,3,7,9,17,25,... (A066983 with 1,0 added to the front) with "A double Fibonacci sequence" (A103609) is the Fibonacci sequence (A000045), with an extra initial 0. LINKS Index entries for linear recurrences with constant coefficients, signature (1,2,-1,0,-1,-1). FORMULA a(n) = F(n) - D(n+1), where F is the Fibonacci sequence (A000045) and D is "A double Fibonacci sequence" (A103609). G.f.: -x^3*(x^2-x-1) / ((x^2+x-1)*(x^4+x^2-1)). - Colin Barker, Oct 13 2014 EXAMPLE a(7)=10 because F(7)=13 and D(8)=3 and a(7)=F(7)-D(8). PROG (PARI) concat([0, 0], Vec(-x^3*(x^2-x-1)/((x^2+x-1)*(x^4+x^2-1)) + O(x^100))) \\ Colin Barker, Oct 13 2014 CROSSREFS Cf. A066983, A103609, A000045. Sequence in context: A065441 A075531 A066067 * A215006 A172516 A102702 Adjacent sequences:  A121361 A121362 A121363 * A121365 A121366 A121367 KEYWORD nonn,easy AUTHOR Graeme McRae, Jul 23 2006 EXTENSIONS More terms from Colin Barker, Oct 13 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified April 17 14:32 EDT 2021. Contains 343063 sequences. (Running on oeis4.)