A000596 -id:A000596 - cp's OEIS frontend

A008955 Triangle of central factorial numbers |t(2n,2n-2k)| read by rows.

1, 1, 1, 1, 5, 4, 1, 14, 49, 36, 1, 30, 273, 820, 576, 1, 55, 1023, 7645, 21076, 14400, 1, 91, 3003, 44473, 296296, 773136, 518400, 1, 140, 7462, 191620, 2475473, 15291640, 38402064, 25401600, 1, 204, 16422, 669188, 14739153, 173721912, 1017067024, 2483133696, 1625702400

Offset: 0

N. J. A. Sloane

Discussion of Central Factorial Numbers by N. J. A. Sloane, Feb 01 2011: (Start)
Here is Riordan's definition of the central factorial numbers t(n,k) given in Combinatorial Identities, Section 6.5:
For n >= 0, expand the polynomial
x^[n] = x*Product{i=1..n-1} (x+n/2-i) = Sum_{k=0..n} t(n,k)*x^k.
The t(n,k) are not always integers. The cases n even and n odd are best handled separately.
For n=2m, we have:
x^[2m] = Product_{i=0..m-1} (x^2-i^2) = Sum_{k=1..m} t(2m,2k)*x^(2k).
E.g. x^[8] = x^2(x^2-1^2)(x^2-2^2)(x^2-3^2) = x^8-14x^6+49x^4-36x^2,
which corresponds to row 4 of the present triangle.
So the m-th row of the present triangle gives the absolute values of the coefficients in the expansion of Product_{i=0..m-1} (x^2-i^2).
Equivalently, and simpler, the n-th row gives the coefficients in the expansion of Product_{i=1..n-1}(x+i^2), highest powers first.
For n odd, n=2m+1, we have:
x^[2m+1] = x*Product_{i=0..m-1}(x^2-((2i+1)/2)^2) = Sum_{k=0..m} t(2m+1,2k+1)*x^(2k+1).
E.g. x^[5] = x(x^2-(1/2)^2)(x^2-(3/2)^2) = x^5-10x^3/4+9x/16,
which corresponds to row 2 of the triangle in A008956.
We now rescale to get integers by replacing x by x/2 and multiplying by 2^(2m+1) (getting 1, -10, 9 from the example).
The result is that row m of triangle A008956 gives the coefficients in the expansion of x*Product_{i=0..m} (x^2-(2i+1)^2).
Equivalently, and simpler, the n-th row of A008956 gives the coefficients in the expansion of Product_{i=0..n-1} (x+(2i+1)^2), highest powers first.
Note that the n-th row of A182867 gives the coefficients in the expansion of Product_{i=1..n} (x+(2i)^2), highest powers first.
(End)
Contribution from Johannes W. Meijer, Jun 18 2009: (Start)
We define Beta(n-z,n+z)/Beta(n,n) = Gamma(n-z)*Gamma(n+z)/Gamma(n)^2 = sum(EG2[2m,n]*z^(2m), m = 0..infinity) with Beta(z,w) the Beta function. The EG2[2m,n] coefficients are quite interesting, see A161739. Our definition leads to EG2[2m,1] = 2*eta(2m) and the recurrence relation EG2[2m,n] = EG2[2m,n-1] - EG2[2m-2,n-1]/(n-1)^2 for m = -2, -1, 0, 1, 2, ... and n = 2, 3, ... , with eta(m) = (1-2^(1-m))*zeta(m) with eta(m) the Dirichlet eta function and zeta(m) the Riemann zeta function. We found for the matrix coefficients EG2[2m,n] = sum((-1)^(k+n)*t1(n-1,k-1)*2*eta(2*m-2*n+2*k)/((n-1)!)^2,k=1..n) with the central factorial numbers t1(n,m) as defined above, see also the Maple program.
From the EG2 matrix we arrive at the ZG2 matrix, see A161739 for its odd counterpart, which is defined by ZG2[2m,1] = 2*zeta(2m) and the recurrence relation ZG2[2m,n] = ZG2[2m-2,n-1]/(n*(n-1))-(n-1)*ZG2[2m,n-1]/n for m = -2, -1, 0, 1, 2, ... and n = 2, 3, ... . We found for the ZG2[2m,n] = Sum_{k=1..n} (-1)^(k+1)*t1(n-1,k-1)* 2* zeta(2*m-2*n+2*k)/((n-1)!*(n)!), and we see that the central factorial numbers t1(n,m) once again play a crucial role.
(End)

			Triangle begins:
  1;
  1,   1;
  1,   5,   4;
  1,  14,  49,  36;
  1,  30, 273, 820, 576;
  ...

B. C. Berndt, Ramanujan's Notebooks Part 1, Springer-Verlag 1985.
J. Riordan, Combinatorial Identities, Wiley, 1968, p. 217.

Alois P. Heinz, Rows n = 0..100, flattened (first 51 rows from T. D. Noe)
M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards, Applied Math. Series 55, Tenth Printing, 1972, Chapter 23, pp. 811-812.
R. H. Boels, Three particle superstring amplitudes with massive legs, arXiv preprint arXiv:1201.2655 [hep-th], 2012.
R. H. Boels and T. Hansen, String theory in target space, arXiv preprint arXiv:1402.6356 [hep-th], 2014.
P. L. Butzer, M. Schmidt, E. L. Stark and L. Vogt, Central Factorial Numbers: Their main properties and some applications, Numerical Functional Analysis and Optimization, 10 (5&6), 419-488 (1989).
M. W. Coffey and M. C. Lettington, On Fibonacci Polynomial Expressions for Sums of mth Powers, their implications for Faulhaber's Formula and some Theorems of Fermat, arXiv:1510.05402 [math.NT], 2015.
T. L. Curtright and T. S. Van Kortryk, On Rotations as Spin Matrix Polynomials, arxiv:1408.0767 [math-ph], 2014.
P. A. MacMahon, Divisors of numbers and their continuations in the theory of partitions, Proc. London Math. Soc., 19 (1919), 75-113; Coll. Papers II, pp. 303-341.
Toshiki Matsusaka, Applications of Faà di Bruno's formula to partition traces, arXiv:2507.00404 [math.NT], 2025. See p. 5.
J. W. Meijer and N. H. G. Baken, The Exponential Integral Distribution, Statistics and Probability Letters, Volume 5, No.3, April 1987. pp 209-211.
Mircea Merca, A Special Case of the Generalized Girard-Waring Formula, J. Integer Sequences, Vol. 15 (2012), Article 12.5.7.
S. Shadrin, L. Spitz, and D. Zvonkine, On double Hurwitz numbers with completed cycles, J. Lond. Math. Soc., II. Ser. 86, No. 2, 407-432 (2012), Corollary 7.5.

Cf. A036969.
Columns include A000330, A000596, A000597. Right-hand columns include A001044, A001819, A001820, A001821. Row sums are in A101686.
Appears in A160464 (Eta triangle), A160474 (Zeta triangle), A160479 (ZL(n)), A161739 (RSEG2 triangle), A161742, A161743, A002195, A002196, A162440 (EG1 matrix), A162446 (ZG1 matrix) and A163927. - Johannes W. Meijer, Jun 18 2009, Jul 06 2009 and Aug 17 2009
Cf. A234324 (central terms).

T:= function(n,k)
    if k=0 then return 1;
    elif k=n then return (Factorial(n))^2;
    else return n^2*T(n-1,k-1) + T(n-1,k);
    fi;
  end;
Flat(List([0..8], n-> List([0..n], k-> T(n,k) ))); # G. C. Greubel, Sep 14 2019

a008955 n k = a008955_tabl !! n !! k
a008955_row n = a008955_tabl !! n
a008955_tabl = [1] : f [1] 1 1 where
   f xs u t = ys : f ys v (t * v) where
     ys = zipWith (+) (xs ++ [t^2]) ([0] ++ map (* u^2) (init xs) ++ [0])
     v = u + 1
-- Reinhard Zumkeller, Dec 24 2013

T:= func< n,k | Factorial(2*(n+1))*(&+[(-1)^j*Binomial(n,k-j)*(&+[2^(m-2*k)*StirlingFirst(2*(n-k+1)+m, 2*(n-k+1))*Binomial(2*(n-k+1)+2*j-1, 2*(n-k+1)+m-1)/Factorial(2*(n-k+1)+m): m in [0..2*j]]): j in [0..k]]) >;
[T(n,k): k in [0..n], n in [0..8]]; // G. C. Greubel, Sep 14 2019

nmax:=7: for n from 0 to nmax do t1(n, 0):=1: t1(n, n):=(n!)^2 end do: for n from 1 to nmax do for k from 1 to n-1 do t1(n, k) := t1(n-1, k-1)*n^2 + t1(n-1, k) end do: end do: seq(seq(t1(n, k), k=0..n), n=0..nmax); # Johannes W. Meijer, Jun 18 2009, Revised Sep 16 2012
t1 := proc(n,k)
        sum((-1)^j*stirling1(n+1,n+1-k+j)*stirling1(n+1,n+1-k-j),j=-k..k) ;
end proc: # Mircea Merca, Apr 02 2012
# third Maple program:
T:= proc(n, k) option remember; `if`(k=0, 1,
      add(T(j-1, k-1)*j^2, j=1..n))
    end:
seq(seq(T(n, k), k=0..n), n=0..8);  # Alois P. Heinz, Feb 19 2022

t[n_, 0]=1; t[n_, n_]=(n!)^2; t[n_ , k_ ]:=t[n, k] = n^2*t[n-1, k-1] + t[n-1, k]; Flatten[Table[t[n, k], {n,0,8}, {k,0,n}] ][[1 ;; 42]]
(* Jean-François Alcover, May 30 2011, after recurrence formula *)

T(n,m):=(2*(n+1))!*sum((-1)^k*binomial(n,m-k)*sum((2^(i-2*m)*stirling1(2*(n-m+1)+i,2*(n-m+1))*binomial(2*(n-m+1)+2*k-1,2*(n-m+1)+i-1))/(2*(n-m+1)+i)!,i,0,2*k),k,0,m); /* Vladimir Kruchinin, Oct 05 2013 */

T(n,k)=if(k==0,1, if(k==n, (n!)^2, n^2*T(n-1, k-1) + T(n-1, k)));
for(n=0,8, for(k=0,n, print1(T(n,k), ", "))) \\ G. C. Greubel, Sep 14 2019

# This triangle is (0,0)-based.
def A008955(n, k) :
    if k==0 : return 1
    if k==n : return factorial(n)^2
    return n^2*A008955(n-1, k-1) + A008955(n-1, k)
for n in (0..7) : print([A008955(n, k) for k in (0..n)]) # Peter Luschny, Feb 04 2012

The n-th row gives the coefficients in the expansion of Product_{i=1..n-1}(x+i^2), highest powers first (see Comments section).
The triangle can be obtained from the recurrence t1(n,k) = n^2*t1(n-1,k-1) + t1(n-1,k) with t1(n,0) = 1 and t1(n,n) = (n!)^2.
t1(n,k) = Sum_{j=-k..k} (-1)^j*s(n+1,n+1-k+j)*s(n+1,n+1-k-j) = Sum_{j=0..2*(n+1-k)} (-1)^(n+1-k+j)*s(n+1,j)*s(n+1,2*(n+1-k)-j), where s(n,k) are Stirling numbers of the first kind, A048994. - Mircea Merca, Apr 02 2012
E.g.f.: cosh(2/sqrt(t)*asin(sqrt(t)*z/2)) = 1 + z^2/2! + (1 + t)*z^4/4! + (1 + 5*t + 4*t^2)*z^6/6! + ... (see Berndt, p.263 and p.306). - Peter Bala, Aug 29 2012
T(n,m) = (2*(n+1))!*Sum_{k=0..m} ((-1)^k*binomial(n,m-k)*Sum_{i=0..2*k} ((2^(i-2*m)*stirling1(2*(n-m+1)+i,2*(n-m+1))*binomial(2*(n-m+1)+2*k-1, 2*(n-m+1)+i-1))/(2*(n-m+1)+i)!)). - Vladimir Kruchinin, Oct 05 2013

There's an error in the last column of Riordan's table (change 46076 to 21076).
More terms from Vladeta Jovovic, Apr 16 2000
Link added and cross-references edited by Johannes W. Meijer, Aug 17 2009
Discussion of Riordan's definition of central factorial numbers added by N. J. A. Sloane, Feb 01 2011

A000597 Central factorial numbers: A008955(n,3).

Original entry on oeis.org

36, 820, 7645, 44473, 191620, 669188, 1999370, 5293970, 12728936, 28285400, 58856655, 115842675, 217378200, 391367064, 679524340, 1142659012, 1867463260, 2975110060, 4631998657, 7063027565, 10567817084, 15540347900, 22492529150, 32082258390, 45146587200

Offset: 4

N. J. A. Sloane

a(n) is the sum of all products of three distinct squares of positive integers up to n, i.e., the sum of all products of three distinct elements from the set of squares {1^2, ..., (n-1)^2}. - Roudy El Haddad, Feb 17 2022

J. Riordan, Combinatorial Identities, Wiley, 1968, p. 217.
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Vincenzo Librandi, Table of n, a(n) for n = 4..1000
Roudy El Haddad, Multiple Sums and Partition Identities, arXiv:2102.00821 [math.CO], 2021.
Roudy El Haddad, A generalization of multiple zeta value. Part 2: Multiple sums. Notes on Number Theory and Discrete Mathematics, 28(2), 2022, 200-233, DOI: 10.7546/nntdm.2022.28.2.200-233. (See Example 5.2 and Theorem 5.1)
Mircea Merca, A Special Case of the Generalized Girard-Waring Formula, J. Integer Sequences, Vol. 15 (2012), Article 12.5.7.
Index entries for sequences related to factorial numbers
Index entries for linear recurrences with constant coefficients, signature (10,-45,120,-210,252,-210,120,-45,10,-1).

Column 3 of triangle A008955.
Cf. A000290 (squares), A000330 (sum of squares), A000596 (for two squares).
Cf. A001303 (for power 1).

1/(-1+z)^10*(z^5+75*z^4+603*z^3+1065*z^2+460*z+36);
seq(stirling1(n,n-3)^2-2*stirling1(n,n-4)*stirling1(n,n-2)+2*stirling1(n,n-5)*stirling1(n,n-1)+2*stirling1(n,n-6),n=0..30); # Mircea Merca, Apr 03 2012

CoefficientList[Series[(x^5 + 75*x^4 + 603*x^3 + 1065*x^2 + 460*x + 36)/(1-x)^10, {x, 0, 20}], x] (* Vaclav Kotesovec, Feb 23 2015 *)
LinearRecurrence[{10, -45, 120, -210, 252, -210, 120, -45, 10, -1}, {36, 820, 7645, 44473, 191620, 669188, 1999370, 5293970, 12728936, 28285400}, 40] (* Vincenzo Librandi, Aug 07 2017 *)

{a(n) = (n-1)*(n-2)*(n-3)*(n)*(2*n-1)*(2*n-3)*(2*n-5)*(35*n^2+21*n+4)/45360}; \\ Roudy El Haddad, Feb 17 2022

O.g.f.: x^4 * (x^5 + 75*x^4 + 603*x^3 + 1065*x^2 + 460*x + 36) / (1-x)^10.
a(n) = s(n,n-3)^2-2*s(n,n-4)*s(n,n-2)+2*s(n,n-5)*s(n,n-1)+2*s(n,n-6), where s(n,k) are Stirling numbers of the first kind, A048994. - Mircea Merca, Apr 03 2012
From Roudy El Haddad, Feb 17 2022: (Start)
a(n) = Sum_{0 < i < j < k < n} (i*j*k)^2.
a(n) = (n - 1)*(n - 2)*(n - 3)*n*(2*n-1)*(2*n - 3)*(2*n - 5)*(35*n^2 + 21*n + 4)/45360.
a(n) = (1/(9!*2))*((2*n)!/(2*n-7)!)*(35*n^2 + 21*n + 4).
a(n) = binomial(2*n,7)*(35*n^2 + 21*n + 4)/144. (End)

A347107 a(n) = Sum_{1 <= i < j <= n} j^3*i^3.

Original entry on oeis.org

0, 0, 8, 251, 2555, 15055, 63655, 214918, 616326, 1561110, 3586110, 7612385, 15139553, 28506101, 51229165, 88438540, 147420940, 238291788, 374813076, 575377095, 864177095, 1272587195, 1840775123, 2619572626, 3672629650, 5078879650, 6935344650, 9360309933

Offset: 0

Roudy El Haddad, Jan 27 2022

a(n) is the sum of all products of two distinct cubes of positive integers up to n, i.e., the sum of all products of two distinct elements from the set of cubes {1^3, ..., n^3}.

			For n=3, a(3) = (2*1)^3+(3*1)^3+(3*2)^3 = 251.

Roudy El Haddad, Multiple Sums and Partition Identities, arXiv:2102.00821 [math.CO], 2021.
Roudy El Haddad, A generalization of multiple zeta value. Part 2: Multiple sums. Notes on Number Theory and Discrete Mathematics, 28(2), 2022, 200-233, DOI: 10.7546/nntdm.2022.28.2.200-233.
Index entries for linear recurrences with constant coefficients, signature (9,-36,84,-126,126,-84,36,-9,1).

Cf. A000537, A000578.
Cf. A346642 (for nondistinct cubes).
Cf. A000217 (for power 0), A000914 (for power 1), A000596 (for squares).

CoefficientList[Series[-(x^5 + 64 x^4 + 424 x^3 + 584 x^2 + 179 x + 8) x^2/(x - 1)^9, {x, 0, 27}], x] (* Michael De Vlieger, Feb 04 2022 *)
LinearRecurrence[{9,-36,84,-126,126,-84,36,-9,1},{0,0,8,251,2555,15055,63655,214918,616326},30] (* Harvey P. Dale, Jul 07 2025 *)

a(n) = sum(i=2, n, sum(j=1, i-1, i^3*j^3));

{a(n) = n*(n+1)*(n-1)*(21*n^5+36*n^4-21*n^3-48*n^2+8)/672};

def A347107(n): return n*(n**2*(n*(n*(n*(n*(21*n + 36) - 42) - 84) + 21) + 56) - 8)//672 # Chai Wah Wu, Feb 17 2022

a(n) = Sum_{j=2..n} Sum_{i=1..j-1} j^3*i^3.
a(n) = n*(n+1)*(n-1)*(21*n^5+36*n^4-21*n^3-48*n^2+8)/672 (from the generalized form of Faulhaber's formula).
From Alois P. Heinz, Jan 27 2022: (Start)
a(n) = Sum_{i=1..n} A000578(i)*A000537(i-1) = Sum_{i=1..n} i^3*(i*(i-1)/2)^2.
G.f.: -(x^5+64*x^4+424*x^3+584*x^2+179*x+8)*x^2/(x-1)^9. (End)

A354021 a(n) = Sum_{1 <= i < j < k < m <= n} (mkj*i)^2.

Original entry on oeis.org

0, 0, 0, 0, 576, 21076, 296296, 2475473, 14739153, 68943381, 268880381, 909450751, 2742417535, 7522650135, 19058554515, 45123156390, 100771975590, 213877057086, 434042943246, 846542846578, 1593528150578

Offset: 0

Roudy El Haddad, May 14 2022

a(n) is the sum of all products of four distinct squares of positive integers up to n, i.e., the sum of all products of four distinct elements from the set of squares {1^2, ..., n^2}.

Winston de Greef, Table of n, a(n) for n = 0..10000
Roudy El Haddad, Multiple Sums and Partition Identities, arXiv:2102.00821 [math.CO], 2021.
Roudy El Haddad, A generalization of multiple zeta value. Part 2: Multiple sums. Notes on Number Theory and Discrete Mathematics, 28(2) 2022, 200-233, DOI: 10.7546/nntdm.2022.28.2.200-233.
Index entries for linear recurrences with constant coefficients, signature (13,-78,286,-715,1287,-1716,1716,-1287,715,-286,78,-13,1).

Cf. A353021 (for nondistinct squares).
Cf. A000290 (squares), A000330 (sum of squares), A000596 (for two squares),  A000597 (for three squares).
Cf. A001298 (for power 1).

{a(n) = n*(n + 1)*(n - 1)*(n - 2)*(n - 3)*(2*n + 1)*(2*n - 1)*(2*n - 3)*(2*n - 5)*(5*n + 7)*(35*n^2 + 98*n + 72)/5443200};

a(n) = Sum_{m=4..n} Sum_{k=3..m-1} Sum_{j=2..k-1} Sum_{i=1..j-1} (m*k*j*i)^2.
a(n) = n*(n+1)*(n-1)*(n-2)*(n-3)*(2*n + 1)*(2*n - 1)*(2*n - 3)*(2*n - 5)*(5*n + 7)*(35*n^2 + 98*n + 72)/5443200.
a(n) = binomial(2*n+2,9)*(5*n + 7)*(35*n^2 + 98*n + 72)/(5!*4).

A351760 a(n) = Sum_{1 <= i < j <= n} (i*j)^4.

Original entry on oeis.org

0, 0, 16, 1393, 26481, 247731, 1516515, 6978790, 26131686, 83684778, 237014778, 607915231, 1436816095, 3170754405, 6600189141, 13064343516, 24750198748, 45116627556, 79482515700, 135826148445, 225852708445, 366397514791, 581244702423, 903454469346, 1378306878690, 2066986566190

Offset: 0

Roudy El Haddad, Feb 18 2022

a(n) is the sum of all products of two distinct elements from the set {1^4, ..., n^4}.

Roudy El Haddad, Multiple Sums and Partition Identities, arXiv:2102.00821 [math.CO], 2021.
Roudy El Haddad, A generalization of multiple zeta value. Part 2: Multiple sums. Notes on Number Theory and Discrete Mathematics, 28(2), 2022, 200-233, DOI: 10.7546/nntdm.2022.28.2.200-233.
Index entries for linear recurrences with constant coefficients, signature (11,-55,165,-330,462,-462,330,-165,55,-11,1).

Cf. A000217 (for power 0), A000914 (for power 1), A000596 (for squares), A347107 (for cubes).

Cf. A000583 (fourth powers), A000538 (sum of fourth powers).

{a(n) = n*(n-1)*(n+1)*(2*n-1)*(2*n+1)*(9*n^5+20*n^4-15*n^3-50*n^2+n+30)/1800};

a(n) = sum(j=2, n, sum(i=1, j-1, i^4*j^4));

def A351760(n): return n*(n*(n*(n*(n*(n*(n*(n*(n*(9*n+20<<2)-105)-300)+88)+390)-20)-200)+1)+30)//1800 # Chai Wah Wu, Oct 03 2024

a(n) = Sum_{j=2..n} Sum_{i=1..j-1} j^4*i^4.
a(n) = n*(n - 1)*(n + 1)*(2*n - 1)*(2*n + 1)*(9*n^5 + 20*n^4 - 15*n^3 - 50*n^2 + n + 30)/1800.
a(n) = binomial(2*n+2, 5)*(9*n^5 + 20*n^4 - 15*n^3 - 50*n^2 + n + 30)/5!.
G.f.: x^2*(16 + 1217*x + 12038*x^2 + 30415*x^3 + 23364*x^4 + 5263*x^5 + 262*x^6 + x^7)/(1 - x)^11. - Stefano Spezia, Feb 18 2022

cp's OEIS Frontend

A008955 Triangle of central factorial numbers |t(2n,2n-2k)| read by rows.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

GAP

Haskell

Magma

Maple

Mathematica

Maxima

PARI

Sage

Formula

Extensions

A000597 Central factorial numbers: A008955(n,3).

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Formula

A347107 a(n) = Sum_{1 <= i < j <= n} j^3*i^3.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

PARI

Python

Formula

A354021 a(n) = Sum_{1 <= i < j < k < m <= n} (m*k*j*i)^2.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

PARI

Formula

A351760 a(n) = Sum_{1 <= i < j <= n} (i*j)^4.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

PARI

PARI

Python

Formula

A351805 a(n) = Sum_{1 <= i < j <= n} j^5*i^5.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

PARI

Formula

A354021 a(n) = Sum_{1 <= i < j < k < m <= n} (mkj*i)^2.