A007696 -id:A007696 - cp's OEIS frontend

A157397 A partition product of Stirling_2 type [parameter k = -5] with biggest-part statistic (triangle read by rows).

1, 1, 5, 1, 15, 45, 1, 105, 180, 585, 1, 425, 2700, 2925, 9945, 1, 3075, 34650, 52650, 59670, 208845, 1, 15855, 308700, 1248975, 1253070, 1461915, 5221125, 1, 123515, 4475520, 23689575, 33972120, 35085960, 41769000

Offset: 1

Peter Luschny, Mar 09 2009

Partition product of prod_{j=0..n-1}((k + 1)*j - 1) and n! at k = -5,
summed over parts with equal biggest part (see the Luschny link).
Underlying partition triangle is A134273.
Same partition product with length statistic is A049029.
Diagonal a(A000217) = A007696.
Row sum is A049120.

Peter Luschny, Counting with Partitions.
Peter Luschny, Generalized Stirling_2 Triangles.

Cf. A157396, A157398, A157399, A157400, A080510, A157401, A157402, A157403, A157404, A157405

T(n,0) = [n = 0] (Iverson notation) and for n > 0 and 1 <= m <= n
T(n,m) = Sum_{a} M(a)|f^a| where a = a_1,..,a_n such that
1*a_1+2*a_2+...+n*a_n = n and max{a_i} = m, M(a) = n!/(a_1!*..*a_n!),
f^a = (f_1/1!)^a_1*..*(f_n/n!)^a_n and f_n = product_{j=0..n-1}(-4*j - 1).

Offset corrected by Peter Luschny, Mar 14 2009

A318179 Expansion of e.g.f. exp((1 - exp(-4*x))/4).

Original entry on oeis.org

1, 1, -3, 5, 25, -343, 2133, -3603, -112975, 1938897, -18008275, 55198805, 1753746377, -45801271943, 649021707397, -4682002329795, -50792700319903, 2692784088681889, -59182401177647011, 801759226622986917, -2169423359710146183, -263145142263538606519, 9869607872225170545333

Offset: 0

Ilya Gutkovskiy, Aug 20 2018

sign

Seiichi Manyama, Table of n, a(n) for n = 0..474
Eric Weisstein's World of Mathematics, Bell Polynomial

Column k=4 of A309386.

Cf. A004213, A007696, A009235, A014182, A317996, A318180, A318181.

seq(n!*coeff(series(exp((1-exp(-4*x))/4),x=0,23),x,n),n=0..22); # Paolo P. Lava, Jan 09 2019

nmax = 22; CoefficientList[Series[Exp[(1 - Exp[-4 x])/4], {x, 0, nmax}], x] Range[0, nmax]!
Table[Sum[(-4)^(n - k) StirlingS2[n, k], {k, 0, n}], {n, 0, 22}]
a[n_] := a[n] = Sum[(-4)^(k - 1) Binomial[n - 1, k - 1] a[n - k], {k, 1, n}]; a[0] = 1; Table[a[n], {n, 0, 22}]
Table[(-4)^n BellB[n, -1/4], {n, 0, 22}] (* Peter Luschny, Aug 20 2018 *)

a(n) = Sum_{k=0..n} (-4)^(n-k)*Stirling2(n,k).
a(0) = 1; a(n) = Sum_{k=1..n} (-4)^(k-1)*binomial(n-1,k-1)*a(n-k).
a(n) = (-4)^n*BellPolynomial_n(-1/4). - Peter Luschny, Aug 20 2018

A256268 Table of k-fold factorials, read by antidiagonals.

Original entry on oeis.org

1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 6, 3, 1, 1, 1, 24, 15, 4, 1, 1, 1, 120, 105, 28, 5, 1, 1, 1, 720, 945, 280, 45, 6, 1, 1, 1, 5040, 10395, 3640, 585, 66, 7, 1, 1, 1, 40320, 135135, 58240, 9945, 1056, 91, 8, 1, 1, 1, 362880, 2027025, 1106560, 208845, 22176, 1729, 120, 9, 1, 1

Offset: 0

Philippe Deléham, Jun 01 2015

A variant of A142589.

			1  1   1    1     1       1         1... A000012
1  1   2    6    24     120       720... A000142
1  1   3   15   105     945     10395... A001147
1  1   4   28   280    3640     58240... A007559
1  1   5   45   585    9945    208845... A007696
1  1   6   66  1056   22176    576576... A008548
1  1   7   91  1729   43225   1339975... A008542
1  1   8  120  2640   76560   2756160... A045754
1  1   9  153  3825  126225   5175225... A045755
1  1  10  190  5320  196840   9054640... A045756
1  1  11  231  7161  293601  14977651... A144773

G. C. Greubel, Antidiagonal rows n = 0..100, flattened

Cf. Columns : A000012, A000012, A000384, A011199, A011245.
Cf. Diagonals : A092985, A076111, A158887.
Cf. A048994, A132393.
Cf. A000142 ("1-fold"), A001147 (2-fold), A007559 (3), A007696 (4), A008548 (5), A008542 (6), A045754 (7), A045755 (8), A045756 (9), A144773 (10)

Flat(List([0..12], n-> List([0..n], k-> Product([0..n-k-1], j-> j*k+1) ))); # G. C. Greubel, Mar 04 2020

function T(n,k)
  if k eq 0 or n eq 0 then return 1;
  else return (&*[j*k+1: j in [0..n-1]]);
  end if; return T; end function;
[T(n-k,k): k in [0..n], n in [0..12]]; // G. C. Greubel, Mar 04 2020

seq(seq( mul(j*k+1, j=0..n-k-1), k=0..n), n=0..12); # G. C. Greubel, Mar 04 2020

T[n_, k_]= Product[j*k+1, {j,0,n-1}]; Table[T[n-k,k], {n,0,12}, {k, 0, n}]//Flatten (* G. C. Greubel, Mar 04 2020 *)

T(n,k) = prod(j=0, n-1, j*k+1);
for(n=0,12, for(k=0, n, print1(T(n-k, k), ", "))) \\ G. C. Greubel, Mar 04 2020

[[ product(j*k+1 for j in (0..n-k-1)) for k in (0..n)] for n in (0..12)] # G. C. Greubel, Mar 04 2020

A(n, k) = (-n)^k*FallingFactorial(-1/n, k) for n >= 1. - Peter Luschny, Dec 21 2021

A051618 a(n) = (4*n+6)(!^4)/6(!^4).

Original entry on oeis.org

1, 10, 140, 2520, 55440, 1441440, 43243200, 1470268800, 55870214400, 2346549004800, 107941254220800, 5397062711040000, 291441386396160000, 16903600410977280000, 1048023225480591360000, 69169532881719029760000, 4841867301720332083200000, 358298180327304574156800000

Offset: 0

Wolfdieter Lang

This sequence is related to A000407 ((4*n+2)(!^4) quartic, or 4-factorials).
Row m=6 of the array A(5; m,n) := ((4*n+m)(!^4))/m(!^4), m >= 0, n >= 0.
a(n) = A001813 a(n+2)/12. - Zerinvary Lajos, Feb 15 2008
For n>4, a(n) mod n^2 = n*(n-2) if n is prime, otherwise 0. - Gary Detlefs, Apr 16 2012

G. C. Greubel, Table of n, a(n) for n = 0..360

Cf. A047053, A007696(n+1), A000407, A034176(n+1), A034177(n+1), A051617 through A051622 (rows m=0..10).

[Factorial(2*n+4)/(12*Factorial(n+2)): n in [0..100]]; // Vincenzo Librandi, Jul 04 2015

seq(mul((n+2+k), k=1..n+2)/12, n=0..17); # Zerinvary Lajos, Feb 15 2008
A051618 := n -> 2^n*(n+1)!*JacobiP(n+1, 1/2, -(n+1), 3)/3:
seq(simplify(A051618(n)), n = 0..19);  # Peter Luschny, Jan 22 2025

s=1;lst={s};Do[s+=n*s;AppendTo[lst, s], {n, 9, 5!, 4}];lst (* Vladimir Joseph Stephan Orlovsky, Nov 08 2008 *)
f[n_] := (2n + 4)!/(12(n + 2)!); Array[f, 16, 0] (* Or *)
FoldList[ #2*#1 &, 1, Range[10, 66, 4]] (* Robert G. Wilson v *)
With[{nn=20},CoefficientList[Series[1/(1-4x)^(5/2),{x,0,nn}],x] Range[0,nn]!] (* Harvey P. Dale, May 24 2015 *)
Table[(Product[(4*k + 6), {k, 0, n}])/6, {n, 0, 50}] (* G. C. Greubel, Jan 27 2017 *)

A051618(n):=(2*n+4)!/(12*(n+2)!)$
makelist(A051618(n),n,0,30); /* Martin Ettl, Nov 05 2012 */

for(n=0,25, print1((2*n+3)!/(6*(n+1)!), ", ")) \\ G. C. Greubel, Jan 27 2017

a(n) = ((4*n+6)(!^4))/6(!^4).
E.g.f.: 1/(1-4*x)^(5/2).
a(n) = (2n+4)!/(12(n+2)!). -  Gary Detlefs, Mar 06 2011
a(n) = (2*n+3)!/(6*(n+1)!). - Gary Detlefs, Apr 16 2012
G.f.: G(0)/2, where G(k)= 1 + 1/(1 - 2*x/(2*x + 1/(2*k+5)/G(k+1))); (continued fraction). - Sergei N. Gladkovskii, Jun 02 2013
a(n) = (4^(1+n)*Gamma(5/2+n))/(3*sqrt(Pi)). - Gerry Martens, Jul 02 2015
a(n) ~ 2^(2*n+5/2) * n^(n+2) / (3*exp(n)). - Vaclav Kotesovec, Jul 04 2015
a(n) = 2^n*(n+1)!*JacobiP(n+1, 1/2, -(n+1), 3)/3. - Peter Luschny, Jan 22 2025

A051622 a(n) = (4n+10)(!^4)/10(!^4), related to A000407 ((4n+2)(!^4) quartic, or 4-factorials).

Original entry on oeis.org

1, 14, 252, 5544, 144144, 4324320, 147026880, 5587021440, 234654900480, 10794125422080, 539706271104000, 29144138639616000, 1690360041097728000, 104802322548059136000, 6916953288171902976000, 484186730172033208320000

Offset: 0

Wolfdieter Lang

Row m=10 of the array A(5; m,n) := ((4*n+m)(!^4))/m(!^4), m >= 0, n >= 0.
From Zerinvary Lajos, Feb 15 2008: (Start)
a(n) = A001813(n+3)/120.
a(n) = A051618(n+1)/10. (End)

G. C. Greubel, Table of n, a(n) for n = 0..363

Cf. A047053, A007696(n+1), A000407, A034176(n+1), A034177(n+1), A051617-A051621 (rows m=0..9).

m:=30; R:=PowerSeriesRing(Rationals(), m); b:=Coefficients(R!(1/(1-4*x)^(14/4))); [Factorial(n-1)*b[n]: n in [1..m]]; // G. C. Greubel, Aug 15 2018

seq(mul((n+3+k), k=1..n+3)/120, n=0..18); # Zerinvary Lajos, Feb 15 2008

s=1;lst={s};Do[s+=n*s;AppendTo[lst, s], {n, 13, 5!, 4}];lst (* Vladimir Joseph Stephan Orlovsky, Nov 08 2008 *)
With[{nn = 30}, CoefficientList[Series[1/(1 - 4*x)^(7/2), {x, 0, nn}], x]*Range[0, nn]!] (* G. C. Greubel, Aug 15 2018 *)

x='x+O('x^30); Vec(serlaplace(1/(1-4*x)^(14/4))) \\ G. C. Greubel, Aug 15 2018

a(n) = ((4*n+10)(!^4))/10(!^4) = A000407(n+2)/(6*10).
E.g.f.: 1/(1-4*x)^(7/2).
G.f.: G(0)/2, where G(k)= 1 + 1/(1 - 2*x/(2*x + 1/(2*k+7)/G(k+1))); (continued fraction). - Sergei N. Gladkovskii, Jun 02 2013

A088991 Derangement numbers d(n,4) where d(n,k) = k(n-1)(d(n-1,k) + d(n-2,k)), with d(0,k) = 1 and d(1,k) = 0.

Original entry on oeis.org

1, 0, 4, 32, 432, 7424, 157120, 3949056, 114972928, 3805503488, 141137150976, 5797706178560, 261309106499584, 12821127008550912, 680286677982625792, 38814037079505895424, 2369659425449311272960, 154142301601844298776576, 10642813349855965483368448

Offset: 0

N. J. A. Sloane, Nov 02 2003

Vincenzo Librandi, Table of n, a(n) for n = 0..200

Cf. A000166, A053871, A033030, A088992.

Cf. A381504.

CoefficientList[Series[E^(-x)/(1-4*x)^(1/4), {x, 0, 20}], x]* Range[0, 20]! (* Vaclav Kotesovec, Oct 08 2013 *)

Inverse binomial transform of A007696. E.g.f.: exp(-x)/(1-4*x)^(1/4). - Vladeta Jovovic, Dec 17 2003
a(n) ~ n^(n-1/4) * Gamma(3/4) * 4^n / (sqrt(Pi)*exp(n+1/4)). - Vaclav Kotesovec, Oct 08 2013
From Seiichi Manyama, Apr 23 2025: (Start)
E.g.f.: B(x)^4, where B(x) is the e.g.f. of A381504.
a(n) = (-1)^n * n! * Sum_{k=0..n} 4^k * binomial(-1/4,k)/(n-k)!. (End)

A303487 a(n) = n! * [x^n] 1/(1 - 4*x)^(n/4).

Original entry on oeis.org

1, 1, 12, 231, 6144, 208845, 8648640, 422463195, 23781703680, 1515973484025, 107941254220800, 8491022274509775, 731304510986649600, 68444451854354701125, 6916953288171902976000, 750681472158682148959875, 87076954662428278259712000, 10751175443940144673035200625

Offset: 0

Ilya Gutkovskiy, Apr 24 2018

nonn

			a(1) = 1;
a(2) = 2*6 = 12;
a(3) = 3*7*11 = 231;
a(4) = 4*8*12*16 = 6144;
a(5) = 5*9*13*17*21 = 208845, etc.

Index entries for sequences related to factorial numbers

Column k=4 of A303489.

Cf. A000407, A001813, A007696, A008545, A034176, A034177, A047053, A051617, A051618, A051619, A051620, A051621, A051622, A113551, A303486, A303488.

Table[n! SeriesCoefficient[1/(1 - 4 x)^(n/4), {x, 0, n}], {n, 0, 17}]
Table[Product[4 k + n, {k, 0, n - 1}], {n, 0, 17}]
Table[4^n Pochhammer[n/4, n], {n, 0, 17}]

a(n) = Product_{k=0..n-1} (4*k + n).
a(n) = 4^n*Gamma(5*n/4)/Gamma(n/4).
a(n) ~ 5^(5*n/4-1/2)*n^n/exp(n).

A346983 Expansion of e.g.f. 1 / (5 - 4 * exp(x))^(1/4).

Original entry on oeis.org

1, 1, 6, 61, 891, 16996, 400251, 11217781, 364638336, 13486045291, 559192836771, 25691965808026, 1295521405067181, 71131584836353861, 4224255395774155566, 269791923787785076921, 18439806740525320993551, 1342957106015632474616956, 103824389511747541791086511

Offset: 0

Ilya Gutkovskiy, Aug 09 2021

Stirling transform of A007696.

Seiichi Manyama, Table of n, a(n) for n = 0..360

Cf. A000670, A007696, A305404, A346982, A346984, A346985, A352117, A352118, A352119.

Cf. A094417, A354242, A365567.

g:= proc(n) option remember; `if`(n<2, 1, (4*n-3)*g(n-1)) end:
b:= proc(n, m) option remember;
     `if`(n=0, g(m), m*b(n-1, m)+b(n-1, m+1))
    end:
a:= n-> b(n, 0):
seq(a(n), n=0..18);  # Alois P. Heinz, Aug 09 2021

nmax = 18; CoefficientList[Series[1/(5 - 4 Exp[x])^(1/4), {x, 0, nmax}], x] Range[0, nmax]!
Table[Sum[StirlingS2[n, k] 4^k Pochhammer[1/4, k], {k, 0, n}], {n, 0, 18}]

a(n) = Sum_{k=0..n} Stirling2(n,k) * A007696(k).
a(n) ~ n! / (Gamma(1/4) * 5^(1/4) * n^(3/4) * log(5/4)^(n + 1/4)). - Vaclav Kotesovec, Aug 14 2021
O.g.f. (conjectural): 1/(1 - x/(1 - 5*x/(1 - 5*x/(1 - 10*x/(1 - 9*x/(1 - 15*x/(1 - ... - (4*n-3)*x/(1 - 5*n*x/(1 - ... ))))))))) - a continued fraction of Stieltjes-type. - Peter Bala, Aug 22 2023
a(0) = 1; a(n) = Sum_{k=1..n} (4 - 3*k/n) * binomial(n,k) * a(n-k). - Seiichi Manyama, Sep 09 2023
a(0) = 1; a(n) = a(n-1) - 5*Sum_{k=1..n-1} (-1)^k * binomial(n-1,k) * a(n-k). - Seiichi Manyama, Nov 16 2023

A034385 Expansion of (1-16*x)^(-1/4), related to quartic factorial numbers.

Original entry on oeis.org

1, 4, 40, 480, 6240, 84864, 1188096, 16972800, 246105600, 3609548800, 53421322240, 796463349760, 11946950246400, 180123249868800, 2727580640870400, 41459225741230080, 632253192553758720

Offset: 0

Wolfdieter Lang

Seiichi Manyama, Table of n, a(n) for n = 0..500
A. Straub, V. H. Moll, and T. Amdeberhan, The p-adic valuation of k-central binomial coefficients, Acta Arith. 140 (1) (2009) 31-41, eq (1.10).

Cf. A007696.

Expansion of (1-b^2*x)^(-1/b): A000984 (b=2), A004987 (b=3), this sequence (b=4), A034688 (b=5), A004993 (b=6), A034835 (b=7), A034977 (b=8), A035024 (b=9), A035308 (b=10).

CoefficientList[Series[1/Surd[1-16x,4],{x,0,20}],x] (* Harvey P. Dale, Aug 06 2018 *)

a(n) = (4^n/n!)*A007696(n), n >= 1, a(0) := 1, A007696(n) = (4*n-3)!^4 := Product_{j = 1..n} 4*j - 3.
G.f.: (1 - 16*x)^(-1/4).
D-finite with recurrence: n*a(n) + 4*(-4*n + 3)*a(n-1) = 0. - R. J. Mathar, Jan 28 2020
From Peter Bala, Mar 31 2024: (Start)
a(n) = (-16)^n*binomial(-1/4, n).
a(n) ~ Gamma(3/4)/(sqrt(2)*Pi) * 16^n/n^(3/4).
E.g.f.: hypergeom([1/4], [1], 16*x).
a(n) = (16^n)*Sum_{k = 0..2*n} (-1)^k*binomial(-1/4, k)* binomial(-1/4, 2*n - k).
(16^n)*a(n) = Sum_{k = 0..2*n} (-1)^k*a(k)*a(2*n-k).
Sum_{k = 0..n} a(k)*a(n-k) = (4^n)*binomial(2*n, n) = A098430.
Sum_{k = 0..2*n} a(k)*a(2*n-k) = (16^n)*binomial(4*n, 2*n). (End)

A144015 Expansion of e.g.f. 1/(1 - sin(4*x))^(1/4).

Original entry on oeis.org

1, 1, 5, 29, 265, 3001, 42125, 696149, 13296145, 287706481, 6959431445, 186061833869, 5448382252825, 173418192216361, 5961442393047965, 220112963745653189, 8687730877758518305, 365023930617143804641, 16266420334783460443685, 766297734521812843642109

Offset: 0

Paul D. Hanna, Sep 09 2008

nonn

Row sums of A186492 - Peter Bala, Feb 22 2011.

			E.g.f.: A(x) = 1 + x + 5*x^2/2! + 29*x^3/3! + 265*x^4/4! + 3001*x^5/5! +...
log(A(x)) = x + 4*x^2/2! + 16*x^3/3! + 128*x^4/4! + 1280*x^5/5! +...
A(x)^2/A(-x)^2 = 1 + 4*x + 16*x^2/2! + 128*x^3/3! +...+ 4^n*A000111(n)*x^n/n! +...
O.g.f.: 1/(1-x - 4*1*1*x^2/(1-5*x - 4*2*3*x^2/(1-9*x - 4*3*5*x^2/(1-13*x - 4*4*7*x^2/(1-17*x - 4*5*9*x^2/(1-...)))))) [continued fraction by Sergei Gladkovskii].

Cf. A000111, A001586, A007788, A186492, A230134, A227544, A230114, A235329.

Cf. A007696, A136630.

CoefficientList[Series[1/(1-Sin[4*x])^(1/4), {x, 0, 20}], x]* Range[0, 20]! (* Vaclav Kotesovec, Jun 26 2013 *)

{a(n)=local(X=x+x*O(x^n)); n!*polcoeff((cos(2*X)-sin(2*X))^(-1/2), n)}
for(n=0, 20, print1(a(n), ", "))

{a(n)=local(A=1+x+x*O(x^n));for(i=0,n,A=exp(intformal(A^2/subst(A^2,x,-x))));n!*polcoeff(A,n)}
for(n=0, 20, print1(a(n), ", "))

/* From A'(x) = A(x)^3 / A(-x)^2: */
{a(n)=local(A=1); for(i=0, n, A=1+intformal(A^3/subst(A, x, -x)^2 +x*O(x^n) )); n!*polcoeff(A, n)}
for(n=0, 20, print1(a(n), ", "))

/* 1/sqrt(1-2*Series_Reversion(Integral 1/sqrt(1+4*x-4*x^2) dx)): */
{a(n)=local(A=1);A=1/sqrt(1-2*serreverse(intformal(1/sqrt(1+4*x-4*x^2 +x*O(x^n)))));n!*polcoeff(A, n)}
for(n=0,20,print1(a(n),", "))

a136630(n, k) = 1/(2^k*k!)*sum(j=0, k, (-1)^(k-j)*(2*j-k)^n*binomial(k, j));
a007696(n) = prod(k=0, n-1, 4*k+1);
a(n) = sum(k=0, n, a007696(k)*(4*I)^(n-k)*a136630(n, k)); \\ Seiichi Manyama, Jun 24 2025

E.g.f. A(x) satisfies:
(1) A(x) = (cos(2*x) - sin(2*x))^(-1/2).
(2) A(x)^2/A(-x)^2 = 1/cos(4*x) + tan(4*x).
(3) A(x) = exp( Integral A(x)^2/A(-x)^2 dx).
(4) A'(x) = A(x)^3/A(-x)^2 with A(0) = 1.
(5) A(x) = 1/sqrt(1 - 2*Series_Reversion( Integral 1/sqrt(1+4*x-4*x^2) dx )).
G.f.: 1/G(0) where G(k) = 1 - x*(4*k+1) - 4*x^2*(k+1)*(2*k+1)/G(k+1); (continued fraction). - Sergei N. Gladkovskii, Jan 11 2013.
a(n) ~ 2^(3*n+5/4)*n^n/(exp(n)*Pi^(n+1/2)). - Vaclav Kotesovec, Jun 26 2013
a(n) = Sum_{k=0..n} A007696(k) * (4*i)^(n-k) * A136630(n,k), where i is the imaginary unit. - Seiichi Manyama, Jun 24 2025

cp's OEIS Frontend

A157397 A partition product of Stirling_2 type [parameter k = -5] with biggest-part statistic (triangle read by rows).

Views

Author

Keywords

Comments

Links

Crossrefs

Formula

Extensions

A318179 Expansion of e.g.f. exp((1 - exp(-4*x))/4).

Views

Author

Keywords

Links

Crossrefs

Programs

Maple

Mathematica

Formula

A256268 Table of k-fold factorials, read by antidiagonals.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

GAP

Magma

Maple

Mathematica

PARI

Sage

Formula

A051618 a(n) = (4*n+6)(!^4)/6(!^4).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Magma

Maple

Mathematica

Maxima

PARI

Formula

A051622 a(n) = (4*n+10)(!^4)/10(!^4), related to A000407 ((4*n+2)(!^4) quartic, or 4-factorials).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Magma

Maple

Mathematica

PARI

Formula

A088991 Derangement numbers d(n,4) where d(n,k) = k(n-1)(d(n-1,k) + d(n-2,k)), with d(0,k) = 1 and d(1,k) = 0.

Views

Author

Keywords

Links

Crossrefs

Programs

Mathematica

Formula

A303487 a(n) = n! * [x^n] 1/(1 - 4*x)^(n/4).

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

A051622 a(n) = (4n+10)(!^4)/10(!^4), related to A000407 ((4n+2)(!^4) quartic, or 4-factorials).