This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A220888 #17 Feb 12 2019 12:02:42
%S A220888 0,0,0,0,2,11,37,98,225,470,919,1713,3082,5400,9274,15688,26236,43499,
%T A220888 71655,117466,191875,312590,508265,825265,1338612,2169696,3514932,
%U A220888 5692128,9215510,14917115,24143209,39072098,63228357,102314870,165559099,267891393,433469566,701381784,1134874030
%N A220888 a(n) = F(n+7) - (1/2)*(n^3+2*n^2+13*n+26) where F(i) is a Fibonacci number (A000045).
%H A220888 J. Freixas and S. Kurz, <a href="http://www.wm.uni-bayreuth.de/fileadmin/Sascha/Publikationen2/Fibonacci.pdf">The golden number and Fibonacci sequences in the design of voting structures</a>, 2012.
%H A220888 J. Freixas and S. Kurz, <a href="https://arxiv.org/abs/1401.8180">The golden number and Fibonacci sequences in the design of voting structures</a>, arXiv:1401.8180 [math.CO], 2014.
%H A220888 <a href="/index/Rec#order_06">Index entries for linear recurrences with constant coefficients</a>, signature (5,-9,6,1,-3,1).
%F A220888 G.f.: -x^4*(2+x) / ( (x^2+x-1)*(x-1)^4 ). - _R. J. Mathar_, Jan 11 2013
%F A220888 a(n) = A014166(n-4)+2*A014166(n-3). - _R. J. Mathar_, Mar 24 2013
%t A220888 LinearRecurrence[{5, -9, 6, 1, -3, 1}, {0, 0, 0, 0, 2, 11}, 39] (* _Jean-François Alcover_, Feb 12 2019 *)
%Y A220888 Cf. A000045, A014166.
%K A220888 nonn
%O A220888 0,5
%A A220888 _N. J. A. Sloane_, Dec 29 2012