OFFSET
0,3
COMMENTS
The first differences are given in A277228. - J. M. Bergot, Sep 14 2016
REFERENCES
T. A. Gulliver, Sequences from Arrays of Integers, Int. Math. Journal, Vol. 1, No. 4, pp. 323-332, 2002.
LINKS
Vincenzo Librandi, Table of n, a(n) for n = 0..2000
Index entries for linear recurrences with constant coefficients, signature (5,-10,10,-5,1).
FORMULA
a(n) = 5*a(n-1) - 10*a(n-2) + 10*a(n-3) - 5*a(n-4) + a(n-5) for n > 4; a(0)=0, a(1)=0, a(2)=3, a(3)=19, a(4)=66. - Yosu Yurramendi, Sep 03 2013
G.f.: x^2*(3 + 4*x + x^2)/(1-x)^5. - Michael De Vlieger, Sep 14 2016
E.g.f.: (1/6)*x^2*(9 + 10*x + 2*x^2)*exp(x). - G. C. Greubel, Sep 23 2016
MATHEMATICA
Table[n (n - 1) (2 n^2 + 1)/6, {n, 0, 37}] (* or *)
CoefficientList[Series[(-3 x^2 - 4 x^3 - x^4)/(-1 + x)^5, {x, 0, 37}], x] (* Michael De Vlieger, Sep 14 2016 *)
PROG
(Magma) [n*(n-1)*(2*n^2+1)/6: n in [0..40]]; // Vincenzo Librandi, Jun 14 2011
(PARI) a(n)=n*(n-1)*(2*n^2+1)/6; \\ Joerg Arndt, Sep 04 2013
(SageMath)
def A071245(n): return binomial(n, 2)*(2*n^2+1)//3
[A071245(n) for n in range(41)] # G. C. Greubel, Aug 07 2024
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
N. J. A. Sloane, Jun 12 2002
STATUS
approved