OFFSET
0,3
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) = floor(n^5/(n+1))/2. - Gary Detlefs, Mar 31 2011
a(n) = 5*a(n-1) - 10*a(n-2) + 10*a(n-3) - 5*a(n-4) + a(n-5) n>4, a(0)=0, a(1)=0, a(2)=5, a(3)=30, a(4)=102. - Yosu Yurramendi, Sep 03 2013
G.f.: x^2*(5+5*x+2*x^2)/(1-x)^5. - Joerg Arndt, Sep 04 2013
From Indranil Ghosh, Apr 05 2017: (Start)
E.g.f.: exp(x)*x^2*(5 + 5*x + x^2)/2.
(End)
MATHEMATICA
f[n_] := n (n - 1) (n^2 + 1)/2 (* Or *) f[n_] := Floor[n^5/(n + 1)]/2; Array[f, 38, 0] (* Robert G. Wilson v, Apr 01 2012 *)
PROG
(Magma) [n*(n-1)*(n^2+1)/2: n in [0..40]]; // Vincenzo Librandi, Jun 14 2011
(PARI) a(n)=n*(n-1)*(n^2+1)/2; \\ Joerg Arndt, Sep 04 2013
(Python) def a(n): return n*(n - 1)*(n**2 + 1)/2 # Indranil Ghosh, Apr 05 2017
(SageMath)
def A071252(n): return binomial(n, 2)*(1+n^2)
[A071252(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