This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A220888 a(n) = F(n+7) - (1/2)*(n^3+2*n^2+13*n+26) where F(i) is a Fibonacci number (A000045). 0
 0, 0, 0, 0, 2, 11, 37, 98, 225, 470, 919, 1713, 3082, 5400, 9274, 15688, 26236, 43499, 71655, 117466, 191875, 312590, 508265, 825265, 1338612, 2169696, 3514932, 5692128, 9215510, 14917115, 24143209, 39072098, 63228357, 102314870, 165559099, 267891393, 433469566, 701381784, 1134874030 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,5 LINKS J. Freixas and S. Kurz, The golden number and Fibonacci sequences in the design of voting structures, 2012. J. Freixas and S. Kurz, The golden number and Fibonacci sequences in the design of voting structures, arXiv:1401.8180 [math.CO], 2014. Index entries for linear recurrences with constant coefficients, signature (5,-9,6,1,-3,1). FORMULA G.f.: -x^4*(2+x) / ( (x^2+x-1)*(x-1)^4 ). - R. J. Mathar, Jan 11 2013 a(n) = A014166(n-4)+2*A014166(n-3). - R. J. Mathar, Mar 24 2013 MATHEMATICA LinearRecurrence[{5, -9, 6, 1, -3, 1}, {0, 0, 0, 0, 2, 11}, 39] (* Jean-François Alcover, Feb 12 2019 *) CROSSREFS Cf. A000045, A014166. Sequence in context: A152819 A297406 A178138 * A289616 A038607 A079009 Adjacent sequences:  A220885 A220886 A220887 * A220889 A220890 A220891 KEYWORD nonn AUTHOR N. J. A. Sloane, Dec 29 2012 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 October 22 12:30 EDT 2019. Contains 328318 sequences. (Running on oeis4.)