OFFSET
0,3
COMMENTS
This is the case d=5 in the general formula n*(n*(n+1)*(2*d*n-2*d+3)/6)-sum(i=0..n-1, i*(i+1)*(2*d*i-2*d+3)/6) = n*(n+1)*(3*d*n^2-d*n+4*n-2*d+2)/12. - Bruno Berselli, Dec 07 2010
The inverse binomial transform yields 0, 1, 23, 52, 30, 0, 0 (0 continued). - R. J. Mathar, Dec 09 2010
LINKS
Vincenzo Librandi, Table of n, a(n) for n = 0..1000
B. Berselli, A description of the recursive method in Comments lines: website Matem@ticamente (in Italian).
Index entries for linear recurrences with constant coefficients, signature (5,-10,10,-5,1).
FORMULA
G.f.: -x*(1+20*x+9*x^2)/(x-1)^5. - R. J. Mathar, Dec 09 2010
a(n)-a(-n) = A063521(n). - Bruno Berselli, Aug 26 2011
MATHEMATICA
CoefficientList[Series[x (1 + 20 x + 9 x^2)/(1 - x)^5, {x, 0, 40}], x] (* Vincenzo Librandi, Jan 01 2014 *)
PROG
(Magma) [n*(n+1)*(15*n^2-n-8)/12: n in [0..50]]; // Vincenzo Librandi, Jan 01 2014
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Vincenzo Librandi, Jan 24 2010
STATUS
approved