OFFSET
0,3
LINKS
Seiichi Manyama, Table of n, a(n) for n = 0..10000
Andrii Husiev, Extended Central Factorial Numbers and the Flickering Operator, arXiv:2605.06689 [math.GM], 2026. See p. 5.
Index entries for linear recurrences with constant coefficients, signature (7,-21,35,-35,21,-7,1).
FORMULA
From Benoit Cloitre, Mar 20 2004: (Start)
a(n) = n*(n + 1)*(n + 2)*(2*n + 1)*(2*n + 3)*(5*n - 1)/360.
a(n) = Sum_{k=1..n} k^2 * Sum_{i=1..k} i^2.
a(n) = Sum_{k=1..n} k^2*A000330(k). (End)
G.f.: -x*(4*x^3+21*x^2+14*x+1) / (x-1)^7. - Colin Barker, Dec 19 2012
a(n) = (2/(2*n)!) * Sum_{j = 1..n} (-1)^(n+j) * j^(2*n+4) * binomial(2*n, n-j). - Peter Bala, Mar 31 2025
Sum_{n>=1} 1/a(n) = (5/1309) * (3750*sqrt(5)*arctanh(1/sqrt(5)) + 50688*log(2) + 9375*log(5) - 37766 - 750*sqrt(5*(5 + 2*sqrt(5)))*Pi). - Amiram Eldar, Dec 30 2025
E.g.f.: exp(x)*x*(360 + 3420*x + 5220*x^2 + 2415*x^3 + 396*x^4 + 20*x^5)/360. - Stefano Spezia, Apr 09 2026
MATHEMATICA
a[n_] := n*(n+1)*(n+2)*(2*n+1)*(2*n+3)*(5*n-1)/360; Array[a, 30, 0] (* Amiram Eldar, Dec 30 2025 *)
PROG
(PARI) a(n)=n*(n + 1)*(n + 2)*(2*n + 1)*(2*n + 3)*(5*n - 1)/360
(Python)
def A060493(n): return n*(n*(n*(n*(n*(20*n+96)+155)+90)+5)-6)//360 # Chai Wah Wu, Apr 09 2026
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Larry Reeves (larryr(AT)acm.org), Mar 20 2001
EXTENSIONS
Missing a(0)=0 inserted by Alois P. Heinz, Feb 19 2022
STATUS
approved
