A047053 -id:A047053 - cp's OEIS frontend

A051620 a(n) = (4n+8)(!^4)/8(!^4), related to A034177(n+1) ((4n+4)(!^4) quartic, or 4-factorials).

1, 12, 192, 3840, 92160, 2580480, 82575360, 2972712960, 118908518400, 5231974809600, 251134790860800, 13059009124761600, 731304510986649600, 43878270659198976000, 2808209322188734464000, 190958233908833943552000

Offset: 0

Wolfdieter Lang

Row m=8 of the array A(5; m,n) := ((4*n+m)(!^4))/m(!^4), m >= 0, n >= 0.

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-A051622 (rows m=0..10).

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

G(x):=(1-4*x)^(n-4): f[0]:=G(x): for n from 1 to 29 do f[n]:=diff(f[n-1],x) od:x:=0:seq(f[n],n=0..15); # Zerinvary Lajos, Apr 04 2009

s=1;lst={s};Do[s+=n*s;AppendTo[lst, s], {n, 11, 5!, 4}];lst (* Vladimir Joseph Stephan Orlovsky, Nov 08 2008 *)
With[{nn=20},CoefficientList[Series[1/(1-4*x)^3,{x,0,nn}],x] Range[0,nn]!] (* Harvey P. Dale, Mar 10 2017 *)

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

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

A167557 The lower left triangle of the ED1 array A167546.

Original entry on oeis.org

1, 1, 4, 2, 12, 32, 6, 48, 160, 384, 24, 240, 960, 2688, 6144, 120, 1440, 6720, 21504, 55296, 122880, 720, 10080, 53760, 193536, 552960, 1351680, 2949120, 5040, 80640, 483840, 1935360, 6082560, 16220160, 38338560, 82575360

Offset: 1

Johannes W. Meijer, Nov 10 2009

We discovered that the numbers that appear in the lower left triangle of the ED1 array A167546 (m <= n) behave in a regular way, see the formula below. This rather simple regularity doesn't show up in the upper right triangle of the ED1 array (m > n).

			The first few triangle rows are:
[1]
[1, 4]
[2, 12, 32]
[6, 48, 160, 384]
[24, 240, 960, 2688, 6144]
[120, 1440, 6720, 21504, 55296, 122880]

G. C. Greubel, Table of n, a(n) for the first 50 rows

A167546 is the ED1 array.
A047053 and A167558 are the first two right hand triangle columns.
A000142, 4*A001710 (n>=2), 32*A001720, 384*A001730, 6144*A049389, 122880*A051431 are the first six left hand triangle columns.
A167559 equals the row sums.

a := proc(n, m): 4^(m-1)*(m-1)!*(n+m-2)!/(2*m-2)! end: seq(seq(a(n, m), m=1..n), n=1..8);  # Johannes W. Meijer, revised Nov 23 2012

Flatten[Table[(4^(m-1) (m-1)!(n+m-2)!)/(2m-2)!,{n,10},{m,n}]] (* Harvey P. Dale, Sep 29 2013 *)

a(n,m) = 4^(m-1)*(m-1)!*(n+m-2)!/(2*m-2)!.

A196347 Triangle T(n, k) read by rows, T(n, k) = n!*binomial(n, k).

Original entry on oeis.org

1, 1, 1, 2, 4, 2, 6, 18, 18, 6, 24, 96, 144, 96, 24, 120, 600, 1200, 1200, 600, 120, 720, 4320, 10800, 14400, 10800, 4320, 720, 5040, 35280, 105840, 176400, 176400, 105840, 35280, 5040, 40320, 322560, 1128960, 2257920, 2822400, 2257920, 1128960, 322560, 40320

Offset: 0

Philippe Deléham, Oct 28 2011

Unsigned version of A021012.

Equal to A136572*A007318.

			Triangle begins:
    1;
    1,   1;
    2,   4,    2;
    6,  18,   18,    6;
   24,  96,  144,   96,  24;
  120, 600, 1200, 1200, 600, 120;
  ...

G. C. Greubel, Table of n, a(n) for n = 0..495
P. Bala, Deformations of the Hadamard product of power series
Paul Barry, On the inversion of Riordan arrays, arXiv:2101.06713 [math.CO], 2021.
M. Dukes, C. D. White, Web Matrices: Structural Properties and Generating Combinatorial Identities, arXiv:1603.01589 [math.CO], 2016.

Cf. A007318, A008619, A021012, A084938, A136572.

Columns include: A000142, A001563, A001804, A001805, A001806, A001807.

/* As triangle */ [[Factorial(n)*Binomial(n, k): k in [0..n]]: n in [0.. 15]]; // Vincenzo Librandi, Sep 28 2015

Table[n!*Binomial[n, j], {n, 0, 30}, {j, 0, n}] (* G. C. Greubel, Sep 27 2015 *)

factorial(n)*binomial(n,k) # Danny Rorabaugh, Sep 27 2015

T(n,k) is given by (1,1,2,2,3,3,4,4,5,5,6,6,...) DELTA (1,1,2,2,3,3,4,4,5,5,6,6, ...) where DELTA is the operator defined in A084938.
Sum_{k>=0} T(m,k)*T(n,k) = (m+n)!.
T(2n,n) = A122747(n).
Sum_{k>=0} T(n,k)^2 = A010050(n) = (2n)!.
Sum_{k>=0} T(n,k)*x^k = A000007(n), A000142(n), A000165(n), A032031(n), A047053(n), A052562(n), A047058(n), A051188(n), A051189(n), A051232(n), A051262(n), A196258(n), A145448(n) for x = -1,0,1,2,3,4,5,6,7,8,9,10,11 respectively.
The row polynomials have the form (x + 1) o (x + 2) o ... o (x + n), where o denotes the black diamond multiplication operator of Dukes and White. See example E10 in the Bala link. - Peter Bala, Jan 18 2018

Name exchanged with a formula by Peter Luschny, Feb 01 2015

A225473 Triangle read by rows, k!*S_4(n, k) where S_m(n, k) are the Stirling-Frobenius subset numbers of order m; n >= 0, k >= 0.

Original entry on oeis.org

1, 3, 4, 9, 40, 32, 27, 316, 672, 384, 81, 2320, 9920, 13824, 6144, 243, 16564, 127680, 326400, 337920, 122880, 729, 116920, 1536992, 6428160, 11642880, 9584640, 2949120, 2187, 821356, 17842272, 114866304, 324065280, 453304320, 309657600, 82575360, 6561

Offset: 0

Peter Luschny, May 17 2013

The Stirling-Frobenius subset numbers are defined in A225468 (see also the Sage program).

			[n\k][0,      1,       2,       3,        4,       5,       6 ]
[0]   1,
[1]   3,      4,
[2]   9,     40,      32,
[3]  27,    316,     672,     384,
[4]  81,   2320,    9920,   13824,     6144,
[5] 243,  16564,  127680,  326400,   337920,  122880,
[6] 729, 116920, 1536992, 6428160, 11642880, 9584640, 2949120.

Vincenzo Librandi, Rows n = 0..50, flattened
Peter Luschny, Generalized Eulerian polynomials.
Peter Luschny, The Stirling-Frobenius numbers.

Cf. A131689 (m=1), A145901 (m=2), A225472 (m=3).

SF_SO := proc(n, k, m) option remember;
if n = 0 and k = 0 then return(1) fi;
if k > n or k < 0 then return(0) fi;
m*k*SF_SO(n-1, k-1, m) + (m*(k+1)-1)*SF_SO(n-1, k, m) end:
seq(print(seq(SF_SO(n, k, 4), k=0..n)), n = 0..5);

EulerianNumber[n_, k_, m_] := EulerianNumber[n, k, m] = (If[ n == 0, Return[If[k == 0, 1, 0]]]; Return[(m*(n-k)+m-1)*EulerianNumber[n-1, k-1, m] + (m*k+1)*EulerianNumber[n-1, k, m]]); SFSO[n_, k_, m_] := Sum[ EulerianNumber[n, j, m]*Binomial[j, n-k], {j, 0, n}]; Table[ SFSO[n, k, 4], {n, 0, 8}, {k, 0, n}] // Flatten (* Jean-François Alcover, May 29 2013, translated from Sage *)

@CachedFunction
def EulerianNumber(n, k, m) :
    if n == 0: return 1 if k == 0 else 0
    return (m*(n-k)+m-1)*EulerianNumber(n-1, k-1, m)+ (m*k+1)*EulerianNumber(n-1, k, m)
def SF_SO(n, k, m):
    return add(EulerianNumber(n, j, m)*binomial(j, n - k) for j in (0..n))
for n in (0..6): [SF_SO(n, k, 4) for k in (0..n)]

For a recurrence see the Maple program.
T(n, 0) ~ A000244; T(n, 1) ~ A190541; T(n, n) ~ A047053.
From Wolfdieter Lang, Jul 12 2017: (Start)
T(n, k) = A225467(n, k)*k! = A225469(n, k)*(4^k*k!), 0 <= k <= n.
T(n, k) = Sum_{m=0..n} binomial(k,m)*(-1)^(k-m)*(3 + 4*m)^n.
Recurrence: T(n, -1) = 0, T(0, 0) = 1, T(n, k) = 0 if n < k and T(n, k) =
4*k*T(n-1, k-1) + (3 + 4*k)*T(n-1, k) for n >= 1, k = 0..n  (see the Maple program).
E.g.f. row polynomials R(n, x) = Sum_{m=0..n} T(n, k)*x^k: exp(3*z)/(1 - x*(exp(4*z) - 1)).
E.g.f. column k: exp(3*x)*(exp(4*x) - 1)^k, k >= 0.
O.g.f. column k: k!*(4*x)^k/Product_{j=0..k} (1 - (3  + 4*j)*x), k >= 0.
(End)

A051619 a(n) = (4n+7)(!^4)/7(!^4), related to A034176(n+1) ((4n+3)(!^4) quartic, or 4-factorials).

Original entry on oeis.org

1, 11, 165, 3135, 72105, 1946835, 60351885, 2112315975, 82380323025, 3542353890075, 166490632833525, 8491022274509775, 467006225098037625, 27553367280784219875, 1735862138689405852125, 116302763292190192092375

Offset: 0

Wolfdieter Lang

Row m=7 of the array A(5; m,n) := ((4*n+m)(!^4))/m(!^4), m >= 0, n >= 0.

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-A051622 (rows m=0..10).

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

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

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

a(n) = ((4*n+7)(!^4))/7(!^4) = A034176(n+2)/7.

E.g.f.: 1/(1-4*x)^(11/4).

A051621 a(n) = (4n+9)(!^4)/9(!^4), related to A007696(n+1) ((4n+1)(!^4) quartic, or 4-factorials).

Original entry on oeis.org

1, 13, 221, 4641, 116025, 3364725, 111035925, 4108329225, 168441498225, 7579867420125, 371413503586125, 19684915690064625, 1122040194333683625, 68444451854354701125, 4448889370533055573125, 306973366566780834545625

Offset: 0

Wolfdieter Lang

Row m=9 of the array A(5; m,n) := ((4*n+m)(!^4))/m(!^4), m >= 0, n >= 0.

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-A051622 (rows m=0..10).

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

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

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

a(n) = ((4*n+9)(!^4))/9(!^4) = A007696(n+3)/(5*9).

E.g.f.: 1/(1-4*x)^(13/4).

A352071 Expansion of e.g.f. 1 / (1 + log(1 - 4*x) / 4).

Original entry on oeis.org

1, 1, 6, 62, 904, 16984, 390128, 10586736, 331267200, 11738697600, 464539452672, 20302660659456, 971106358760448, 50452643588275200, 2829000818124208128, 170271405502300207104, 10948525752699316371456, 748994717201835804033024, 54315931193865932254543872

Offset: 0

Ilya Gutkovskiy, Mar 02 2022

nonn

Cf. A007840, A047053, A210246, A227917, A326324, A352069.

nmax = 18; CoefficientList[Series[1/(1 + Log[1 - 4 x]/4), {x, 0, nmax}], x] Range[0, nmax]!
Table[Sum[StirlingS1[n, k] k! (-4)^(n - k), {k, 0, n}], {n, 0, 18}]

my(x='x+O('x^25)); Vec(serlaplace(1/(1+log(1-4*x)/4))) \\ Michel Marcus, Mar 02 2022

a(n) = Sum_{k=0..n} Stirling1(n,k) * k! * (-4)^(n-k).
a(0) = 1; a(n) = Sum_{k=1..n} binomial(n,k) * (k-1)! * 4^(k-1) * a(n-k).
a(n) ~ n! * 4^(n+1) * exp(4*n) / (exp(4) - 1)^(n+1). - Vaclav Kotesovec, Mar 03 2022

A370915 A(n, k) = 4^n*Pochhammer(k/4, n). Square array read by ascending antidiagonals.

Original entry on oeis.org

1, 0, 1, 0, 1, 1, 0, 5, 2, 1, 0, 45, 12, 3, 1, 0, 585, 120, 21, 4, 1, 0, 9945, 1680, 231, 32, 5, 1, 0, 208845, 30240, 3465, 384, 45, 6, 1, 0, 5221125, 665280, 65835, 6144, 585, 60, 7, 1, 0, 151412625, 17297280, 1514205, 122880, 9945, 840, 77, 8, 1

Offset: 0

Peter Luschny, Mar 06 2024

The sequence of square arrays A(m, n, k) starts: A094587 (m = 1), A370419 (m = 2), A371077(m = 3), this array (m = 4).

			The array starts:
[0] 1,    1,     1,     1,      1,      1,      1,      1,      1, ...
[1] 0,    1,     2,     3,      4,      5,      6,      7,      8, ...
[2] 0,    5,    12,    21,     32,     45,     60,     77,     96, ...
[3] 0,   45,   120,   231,    384,    585,    840,   1155,   1536, ...
[4] 0,  585,  1680,  3465,   6144,   9945,  15120,  21945,  30720, ...
[5] 0, 9945, 30240, 65835, 122880, 208845, 332640, 504735, 737280, ...
.
Seen as the triangle T(n, k) = A(n - k, k):
[0] 1;
[1] 0,      1;
[2] 0,      1,     1;
[3] 0,      5,     2,    1;
[4] 0,     45,    12,    3,   1;
[5] 0,    585,   120,   21,   4,  1;
[6] 0,   9945,  1680,  231,  32,  5, 1;
[7] 0, 208845, 30240, 3465, 384, 45, 6, 1;

Similar square arrays: A094587, A370419, A371077.
Rows: A000012, A001477, A028347, A370914.
Columns: A000007, A007696, A001813, A008545, A047053, A007696, A000407, A034176, A052570 and A034177, A051617, A051618, A051619, A051620.
Cf. A370913 (row sums of triangle), A371026.

A := (n, k) -> 4^n*pochhammer(k/4, n):
for n from 0 to 5 do seq(A(n, k), k = 0..9) od;
T := (n, k) -> A(n - k, k): seq(seq(T(n, k), k = 0..n), n = 0..9);
# Using the exponential generating functions of the columns:
EGFcol := proc(k, len) local egf, ser, n; egf := (1 - 4*x)^(-k/4);
ser := series(egf, x, len+2): seq(n!*coeff(ser, x, n), n = 0..len) end:
seq(lprint(EGFcol(n, 9)), n = 0..5);
# Using the generating polynomials for the rows:
P := (n, x) -> local k; add(Stirling1(n, k)*(-4)^(n - k)*x^k, k=0..n):
seq(lprint([n], seq(P(n, k), k = 0..8)), n = 0..5);
# Implementing the LU decomposition of A:
with(LinearAlgebra):
L := Matrix(7, 7, (n, k) -> A371026(n-1, k-1)):
U := Matrix(7, 7, (n, k) -> binomial(n-1, k-1)):
MatrixMatrixMultiply(L, Transpose(U));

A[n_, k_] := 4^n * Pochhammer[k/4, n]; Table[A[n - k, k], {n, 0, 9}, {k, 0, n}] // Flatten (* Amiram Eldar, Mar 06 2024 *)

def A(n, k): return 4**n * rising_factorial(k/4, n)
for n in range(6): print([A(n, k) for k in range(9)])

A(n, k) = 4^n*Product_{j=0..n-1} (j + k/4).
A(n, k) = 4^n*Gamma(k/4 + n) / Gamma(k/4) for k >= 1.
The exponential generating function for column k is (1 - 4*x)^(-k/4). But much more is true: (1 - m*x)^(-k/m) are the exponential generating functions for the columns of the arrays A(m, n, k) = m^n*Pochhammer(k/m, n).
The polynomials P(n, x) = Sum_{k=0..n} Stirling1(n, k)*(-4)^(n-k)*x^k are ordinary generating functions for row n, i.e., A(n, k) = P(n, k).
In A370419 Werner Schulte pointed out how A371025 is related to the LU decomposition of A370419. Here the same procedure can be used and amounts to A = A371026 * transpose(binomial triangle), where '*' denotes matrix multiplication. See the Maple section for an implementation.

A131182 Table T(n,k) = n!*k^n, read by upwards antidiagonals.

Original entry on oeis.org

1, 0, 1, 0, 1, 1, 0, 2, 2, 1, 0, 6, 8, 3, 1, 0, 24, 48, 18, 4, 1, 0, 120, 384, 162, 32, 5, 1, 0, 720, 3840, 1944, 384, 50, 6, 1, 0, 5040, 46080, 29160, 6144, 750, 72, 7, 1, 0, 40320, 645120, 524880, 122880, 15000, 1296, 98, 8, 1, 0, 362880, 10321920, 11022480, 2949120, 375000, 31104, 2058, 128, 9, 1

Offset: 0

Philippe Deléham, Sep 25 2007

For k>0, T(n,k) is the n-th moment of the exponential distribution with mean = k. - Geoffrey Critzer, Jan 06 2019

T(n,k) is the minimum value of Product_{i=1..n} Sum_{j=1..k} r_j[i] where each r_j is a permutation of {1..n}. For the maximum value, see A331988. - Chai Wah Wu, Sep 01 2022

			The (inverted) table begins:
k=0: 1, 0,   0,    0,      0,       0, ... (A000007)
k=1: 1, 1,   2,    6,     24,     120, ... (A000142)
k=2: 1, 2,   8,   48,    384,    3840, ... (A000165)
k=3: 1, 3,  18,  162,   1944,   29160, ... (A032031)
k=4: 1, 4,  32,  384,   6144,  122880, ... (A047053)
k=5: 1, 5,  50,  750,  15000,  375000, ... (A052562)
k=6: 1, 6,  72, 1296,  31104,  933120, ... (A047058)
k=7: 1, 7,  98, 2058,  57624, 2016840, ... (A051188)
k=8: 1, 8, 128, 3072,  98304, 3932160, ... (A051189)
k=9: 1, 9, 162, 4374, 157464, 7085880, ... (A051232)
Main diagonal is 1, 1, 8, 162, 6144, 375000, ... (A061711).

Chai Wah Wu, Permutations r_j such that ∑i∏j r_j(i) is maximized or minimized, arXiv:1508.02934 [math.CO], 2015-2020.
Chai Wah Wu, On rearrangement inequalities for multiple sequences, arXiv:2002.10514 [math.CO], 2020.

Columns k=0-9 give: A000007, A000142, A000165, A032031, A047053, A052562, A047058, A051188, A051189, A051232.
Main diagonal gives A061711.
Cf. A292783, A303489, A331988.

T:= (n,k)-> n!*k^n:
seq(seq(T(d-k, k), k=0..d), d=0..12);  # Alois P. Heinz, Jan 06 2019

from math import factorial
def A131182_T(n, k): # compute T(n, k)
    return factorial(n)*k**n # Chai Wah Wu, Sep 01 2022

From Ilya Gutkovskiy, Aug 11 2017: (Start)
G.f. of column k: 1/(1 - k*x/(1 - k*x/(1 - 2*k*x/(1 - 2*k*x/(1 - 3*k*x/(1 - 3*k*x/(1 - ...))))))), a continued fraction.
E.g.f. of column k: 1/(1 - k*x). (End)

A285066 Triangle read by rows: T(n, m) = A285061(n, m)*m!, 0 <= m <= n.

Original entry on oeis.org

1, 1, 4, 1, 24, 32, 1, 124, 480, 384, 1, 624, 5312, 10752, 6144, 1, 3124, 52800, 203520, 276480, 122880, 1, 15624, 500192, 3279360, 7956480, 8110080, 2949120, 1, 78124, 4626720, 48633984, 187729920, 329441280, 268369920, 82575360, 1, 390624, 42265472, 687762432, 3969552384, 10672865280, 14615838720, 9909043200, 2642411520, 1, 1953124, 383514240, 9448097280, 78486589440, 303521218560, 621544734720, 696605736960, 404288962560, 95126814720

Offset: 0

Wolfdieter Lang, Apr 19 2017

This is the Sheffer triangle S2[4,1] = A285061 with column m scaled by m!. This is the fourth member of the triangle family A131689, A145901 and A284861.
This triangle appears in the o.g.f. G(n, x) = Sum_{m=0..n} T(n, m)*x^m/(1-x)^(m+1), n >= 0, of the power sequence {(1+4*m)^n}_{m >= 0}.
The diagonal sequence is A047053. The row sums give A285067. The alternating sum of row n is A141413(n+2), n >= 0.
The first column sequences are: A000012, 4*A003463, 2!*4^2*A016234.

			The triangle T(n, m) begins:
  n\m 0     1       2        3         4         5         6        7
  0:  1
  1:  1     4
  2:  1    24      32
  3:  1   124     480      384
  4:  1   624    5312    10752      6144
  5:  1  3124   52800   203520    276480    122880
  6:  1 15624  500192  3279360   7956480   8110080   2949120
  7:  1 78124 4626720 48633984 187729920 329441280 268369920 82575360
  ...
row 8: 1 390624 42265472 687762432 3969552384 10672865280 14615838720 9909043200 2642411520
row 9: 1 1953124 383514240 9448097280 78486589440 303521218560 621544734720 696605736960 404288962560 95126814720
...

Wolfdieter Lang, On Sums of Powers of Arithmetic Progressions, and Generalized Stirling, Eulerian and Bernoulli numbers, arXiv:1707.04451 [math.NT], 2017.

Cf. A000012, 4*A003463, 32*A016234, A111578 (T(n, m)/4^m), A131689, A141413, A145901, A225118, A225472, A225473, A284861, A285061.

T[n_, m_]:=Sum[Binomial[m, k]*(-1)^(k - m)*(1 + 4k)^n, {k, 0, n}]; Table[T[n, m], {n, 0, 10},{m, 0, n}] // Flatten (* Indranil Ghosh, May 02 2017 *)

from sympy import binomial
def T(n, m):
    return sum([binomial(m, k)*(-1)**(k - m)*(1 + 4*k)**n for k in range(n + 1)])
for n in range(21):
    print([T(n, m) for m in range(n + 1)])
# Indranil Ghosh, May 02 2017

T(n, m) = A285061(n, m)*m! = A111578(n, m)*(4^m*m!), 0 <= m <= n.
T(n, m) = Sum_{k=0..n} binomial(m,k)*(-1)^(k-m)*(1+4*k)^n.
T(n, m) = Sum_{j=0..n} binomial(n-j,m-j)*A225118(n,n-j).
Recurrence: T(n, -1) = 0, T(0, 0) = 1, T(n, m) = 0 if n < m and T(n, m) =
4*m*T(n-1, m-1) + (1+4*m)*T(n-1, m) for n >= 1, m=0..n.
E.g.f. row polynomials R(n, x) = Sum_{m=0..n} T(n, m)*x^m: exp(z)/(1 - x*(exp(4*z) - 1)).
E.g.f. column m: exp(x)*(exp(4*x) - 1)^m, m >= 0.
O.g.f. column m: m!*(4*x)^m/Product_{j=0..m} (1 - (1 + 4*j)*x), m >= 0.

cp's OEIS Frontend

A051620 a(n) = (4*n+8)(!^4)/8(!^4), related to A034177(n+1) ((4*n+4)(!^4) quartic, or 4-factorials).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Magma

Maple

Mathematica

PARI

Formula

A167557 The lower left triangle of the ED1 array A167546.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

Formula

A196347 Triangle T(n, k) read by rows, T(n, k) = n!*binomial(n, k).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Magma

Mathematica

Sage

Formula

Extensions

A225473 Triangle read by rows, k!*S_4(n, k) where S_m(n, k) are the Stirling-Frobenius subset numbers of order m; n >= 0, k >= 0.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

Sage

Formula

A051619 a(n) = (4*n+7)(!^4)/7(!^4), related to A034176(n+1) ((4*n+3)(!^4) quartic, or 4-factorials).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Magma

Mathematica

PARI

Formula

A051621 a(n) = (4*n+9)(!^4)/9(!^4), related to A007696(n+1) ((4*n+1)(!^4) quartic, or 4-factorials).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Magma

Mathematica

PARI

Formula

A352071 Expansion of e.g.f. 1 / (1 + log(1 - 4*x) / 4).

Views

Author

A051620 a(n) = (4n+8)(!^4)/8(!^4), related to A034177(n+1) ((4n+4)(!^4) quartic, or 4-factorials).

A051619 a(n) = (4n+7)(!^4)/7(!^4), related to A034176(n+1) ((4n+3)(!^4) quartic, or 4-factorials).

A051621 a(n) = (4n+9)(!^4)/9(!^4), related to A007696(n+1) ((4n+1)(!^4) quartic, or 4-factorials).