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

OEIS matches ?

• A355218: row sums, 15 terms agree OEIS nonn (row-sum match: finite agreement only) · view at the OEIS · generated b-file 200 terms from n = 0 ?
• A225472: triangle, 40 terms agree, 8 full rows row-aligned (tabl) OEIS nonn in polytool catalog · view at the OEIS · generated b-file 990 terms from n = 0 ?

A generated b-file is computed from the node's definition along the row alignment of its OEIS link and starts at the entry's offset. It is an identification on a finite prefix, not a proof that the node and the OEIS entry agree for every n.

OEIS submission text ?

Fields to paste into an OEIS submission: the example %e, the formula %F and programs %t (Mathematica) and %o (PARI/GP) that list the same rows. For an OEIS link the row numbers, the offset and the orientation are those of the entry, as matched; the matched terms were compared with the published ones, which identifies the node with the entry on a finite prefix, not for every n. The PARI/GP program is not machine-checked here.

Triangle begins:
   1:   1;
   2:   2,       3;
   3:   4,      21,        18;
   4:   8,     117,       270,        162;
   5:  16,     609,      2862,       4212,        1944;
   6:  32,    3093,     26550,      72090,       77760,       29160;
   7:  64,   15561,    230958,    1031940,     1953720,     1662120,      524880;
   8: 128,   77997,   1941030,   13429962,    39735360,    57561840,    40415760,    11022480;
   9: 256,  390369,  15996222,  165198852,   717454584,  1574581680,  1844428320,  1102248000,   264539520;
  10: 512, 1952613, 130311990, 1961153370, 12026750400, 37529707320, 65231036640, 64084698720, 33331979520, 7142567040;

The row polynomials satisfy P(n,x) = (2+3*x)*P(n-1,x) + (3*x+3*x^2)*d/dx P(n-1,x) for n >= 2, with P(1,x) = 1.

P[1, x_] := 1;
P[n_, x_] := P[n, x] = Expand[(2 + 3*x)*P[n - 1, x] + (3*x + 3*x^2)*D[P[n - 1, x], x]];
Table[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten

P(N) = {my(v = vector(N)); v[1] = 1; for(n = 2, N, my(i = n); v[i] = (2 + 3*x)*v[i - 1] + (3*x + 3*x^2)*deriv(v[i - 1], x)); v};
row(n, p) = {my(c = Vecrev(p)); c};
T(N) = {my(v = P(N)); concat(vector(#v, i, row(i, v[i])))};
T(10)

Triangle begins:
  0:   1;
  1:   2,       3;
  2:   4,      21,        18;
  3:   8,     117,       270,        162;
  4:  16,     609,      2862,       4212,        1944;
  5:  32,    3093,     26550,      72090,       77760,       29160;
  6:  64,   15561,    230958,    1031940,     1953720,     1662120,      524880;
  7: 128,   77997,   1941030,   13429962,    39735360,    57561840,    40415760,    11022480;
  8: 256,  390369,  15996222,  165198852,   717454584,  1574581680,  1844428320,  1102248000,   264539520;
  9: 512, 1952613, 130311990, 1961153370, 12026750400, 37529707320, 65231036640, 64084698720, 33331979520, 7142567040;

The row polynomials satisfy P(n,x) = (2+3*x)*P(n-1,x) + (3*x+3*x^2)*d/dx P(n-1,x) for n >= 1, with P(0,x) = 1.

P[0, x_] := 1;
P[n_, x_] := P[n, x] = Expand[(2 + 3*x)*P[n - 1, x] + (3*x + 3*x^2)*D[P[n - 1, x], x]];
Table[PadRight[CoefficientList[P[n, x], x], n + 1], {n, 0, 9}] // Flatten

P(N) = {my(v = vector(N + 1)); v[1] = 1; for(n = 1, N, my(i = n + 1); v[i] = (2 + 3*x)*v[i - 1] + (3*x + 3*x^2)*deriv(v[i - 1], x)); v};
row(n, p) = {my(c = Vecrev(p)); c = concat(c, vector(n + 1 - #c)); c};
T(N) = {my(v = P(N)); concat(vector(#v, i, row(i - 1, v[i])))};
T(9)

Proved properties

• Real-rooted. Every row P_n, n >= 1, is zero or real-rooted with all roots in (-1, 0)
  Every polynomial of the sequence has only real roots, inside the stated interval.
  by the cited steps: e-2d30e6aff83a7d44
• Coefficients of one sign. Every nonzero row, n >= 1: the coefficients of P_n have one sign
  All coefficients of each polynomial have the same sign (after x -> -x when alternating).
  derived from the cited steps by a stated theorem: e-2d30e6aff83a7d44
• Hadamard kernel (Malo). Rows P_n, n >= 1, are Hadamard kernels (preserve real-rootedness)
  Multiplying the coefficients of any real-rooted polynomial termwise by those of a row (Hadamard product) gives a real-rooted polynomial again.
  derived from the cited steps by a stated theorem: e-2d30e6aff83a7d44
• Interlacing of consecutive rows. Rows P_(m-1), P_m interlace (weak, previous interlaces next) for every m >= 2
  The roots of consecutive polynomials alternate on the real line.
  by the cited steps: e-2d30e6aff83a7d44
• Basis map preserves real-rootedness. Basis map u^k -> P_k sends roots in [-1, 2] to roots in [-1, 0]: source [-1, 2], target [-1, 0]
  The linear map sending x^k to the k-th polynomial of the sequence turns polynomials with roots in one interval into real-rooted ones.
  by the cited steps: e-b34b25094085d207

Proof chains

2 incoming proof steps. Each step is expanded back to the roots of the proof DAG, the theorem checks of a node's own rule. JSON

• basis_map_theorem e-b34b25094085d207 root: theorem check

  Interval basis map theorem [MW08, Thm 2, Cor 3] polytool RealRooted intervalBasisMap_maps_realRootedIn_iff ?

• theorem_check ma_wang_interval e-2d30e6aff83a7d44 root: theorem check

  Ma–Wang interval theorem [MW08, Thm 2, Cor 3] RealRooted RealRooted.affineEndpointStep_closed ?

Used in 2 proof steps

• e-2dc56bf9965267b7 obreschkoff_combination → obreschkoff_combination of Triangle read by rows, k!*S_3(n, k) where S_m(n, k) are the St…
• e-2dc56bf9965267b7 obreschkoff_combination → obreschkoff_combination of Triangle read by rows, k!*S_3(n, k) where S_m(n, k) are the St…

Related sequences ?

No candidate equalities or related sequences.

References

1. [MW08] Shi-Mei Ma and Yi Wang. q-Eulerian polynomials and polynomials with only real zeros. The Electronic Journal of Combinatorics, 15(1):Research Paper 17, January 2008. doi:10.37236/741