A278074
Triangle read by rows, coefficients of the polynomials P(m, n) = Sum_{k=1..n} binomial(m*n, m*k)* P(m, n-k)*z with P(m, 0) = 1 and m = 4.
Original entry on oeis.org
1, 0, 1, 0, 1, 70, 0, 1, 990, 34650, 0, 1, 16510, 2702700, 63063000, 0, 1, 261630, 213519150, 17459442000, 305540235000, 0, 1, 4196350, 17651304000, 4350310965000, 231905038365000, 3246670537110000
Offset: 0
Triangle starts:
[1]
[0, 1]
[0, 1, 70]
[0, 1, 990, 34650]
[0, 1, 16510, 2702700, 63063000]
[0, 1, 261630, 213519150, 17459442000, 305540235000]
-
P := proc(m,n) option remember; if n = 0 then 1 else
add(binomial(m*n,m*k)* P(m,n-k)*x, k=1..n) fi end:
for n from 0 to 6 do PolynomialTools:-CoefficientList(P(4,n), x) od;
# Alternatively:
A278074_row := proc(n) 1/(1-t*((cosh(x)+cos(x))/2-1)); expand(series(%,x,4*n+1));
(4*n)!*coeff(%,x,4*n); PolynomialTools:-CoefficientList(%,t) end:
for n from 0 to 5 do A278074_row(n) od;
-
With[{m = 4}, Table[Expand[j!*SeriesCoefficient[1/(1 - t*(MittagLefflerE[m, x^m] - 1)), {x, 0, j}]], {j, 0, 24, m}]];
Function[arg, CoefficientList[arg, t]] /@ % // Flatten
-
# uses [P from A278073]
def A278074_row(n): return list(P(4, n))
for n in (0..6): print(A278074_row(n)) # Peter Luschny, Mar 24 2020
A281478
Central coefficients of Joffe's central differences of zero (assuming offset 0 and T(n,k) extended to 0 <= k <= n in A241171).
Original entry on oeis.org
1, 1, 126, 126720, 494053560, 5283068427000, 126301275727704000, 5896518025761483120000, 488276203972584492344880000, 66735969985432035804226510800000, 14236685931434801591697761172512160000, 4533351707244550464920840944132383960960000, 2077486542875366717627638783543223150778585600000
Offset: 0
A281479
Central coefficients of the polynomials defined in A278073.
Original entry on oeis.org
1, 1, 1364, 42771456, 10298900437056, 11287986820196486400, 41397337338743872194508800, 414528538783792919989135797964800, 9808376038359632185170127842947907993600, 492228239722024416239987973400425228541016064000
Offset: 0
A327024
Ordered set partitions of the set {1, 2, ..., 4*n} with all block sizes divisible by 4, irregular triangle T(n, k) for n >= 0 and 0 <= k < A000041(n), read by rows.
Original entry on oeis.org
1, 1, 1, 70, 1, 990, 34650, 1, 3640, 12870, 2702700, 63063000, 1, 9690, 251940, 26453700, 187065450, 17459442000, 305540235000, 1, 21252, 1470942, 2704156, 154448910, 8031343320, 9465511770, 374796021600, 3975514943400, 231905038365000, 3246670537110000
Offset: 0
Triangle starts (note the subdivisions by ';' (A072233)):
[0] [1]
[1] [1]
[2] [1; 70]
[3] [1; 990; 34650]
[4] [1; 3640, 12870; 2702700; 63063000]
[5] [1; 9690, 251940; 26453700, 187065450; 17459442000; 305540235000]
[6] [1; 21252, 1470942, 2704156; 154448910, 8031343320, 9465511770;
374796021600, 3975514943400; 231905038365000; 3246670537110000]
.
T(4, 1) = 3640 because [12, 4] is the integer partition 4*P(4, 1) in the canonical order and there are 1820 set partitions which have the shape [12, 4]. Finally, since the order of the sets is taken into account, one gets 2!*1820 = 3640.
Showing 1-4 of 4 results.
Comments