A143491 → basis A013611

OEIS matches ?

• A001730: row sums, 15 terms agree OEIS nonn (row-sum match: finite agreement only) · view at the OEIS

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:
  0:         12,          28,          16;
  1:         60,         188,         192,           64;
  2:        360,        1368,        1904,         1152,          256;
  3:       2520,       11016,       18800,        15680,         6400,        1024;
  4:      20160,       98208,      194464,       200640,       113920,       33792,        4096;
  5:     181440,      964512,     2143008,      2583616,      1827840,      759808,      172032,       16384;
  6:    1814400,    10370880,    25288128,     34408192,     28612864,    14909440,     4759552,      851968,      65536;
  7:   19958400,   121337280,   319652928,    479642624,    452374272,   278455296,   111992832,    28409856,    4128768,    262144;
  8:  239500800,  1535880960,  4321184256,   7034323200,   7347061760,  5150960640,  2457735168,   788889600,  163184640,  19660800,  1048576;
  9: 3113510400, 20924455680, 62318919168, 108730938624, 123649095680, 96350735360, 52554399744, 20086505472, 5276958720, 908328960, 92274688, 4194304;

The row polynomials satisfy P(n,x) = (n+4+4*x)*P(n-1,x) for n >= 1, with P(0,x) = 12 + 28*x + 16*x^2.

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

P(N) = {my(v = vector(N + 1)); v[1] = 12 + 28*x + 16*x^2; for(n = 1, N, my(i = n + 1); v[i] = (n + 4 + 4*x)*v[i - 1]); v};
row(n, p) = {my(c = Vecrev(p)); 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 >= 0, is zero or real-rooted with all roots in (-inf, 0]
  Every polynomial of the sequence has only real roots, inside the stated interval.
  by the cited steps: e-120de3004347d127
• Coefficients of one sign. Every nonzero row, n >= 0: 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-120de3004347d127
• Hadamard kernel (Malo). Rows P_n, n >= 0, 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-120de3004347d127

Proof chains

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

• basis_map A013611 e-120de3004347d127

  Geometric basis map (elementary) polytool ?

  • premise (sequence): Unsigned 2-Stirling numbers of the first kind.
    uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
    • theorem_check liu_wang e-84f3431e657be6ed root: theorem check

      Liu–Wang theorem [LW07, Thm 2.1, Cor 2.4] ?

    • parent_provers root_domain e-25f97869157cba20 root: theorem check

      Parent-row provers of polytool polytool ?

Related sequences ?

Same fingerprint (1)

Equal up to content, sign, reversal and a small index shift.

• A136124 → basis A013611

References

1. [LW07] Lily L. Liu and Yi Wang. A unified approach to polynomial sequences with only real zeros. Advances in Applied Mathematics, 38(4):542–560, May 2007. doi:10.1016/j.aam.2006.02.003