A143491 → basis A007318

OEIS matches ?

• A001715: 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,          7,          1;
  1:         60,         47,         12,          1;
  2:        360,        342,        119,         18,         1;
  3:       2520,       2754,       1175,        245,        25,        1;
  4:      20160,      24552,      12154,       3135,       445,       33,        1;
  5:     181440,     241128,     133938,      40369,      7140,      742,       42,       1;
  6:    1814400,    2592720,    1580508,     537628,    111769,    14560,     1162,      52,     1;
  7:   19958400,   30334320,   19978308,    7494416,   1767087,   271929,    27342,    1734,    63,    1;
  8:  239500800,  383970240,  270074016,  109911300,  28699460,  5030235,   600033,   48150,  2490,   75,  1;
  9: 3113510400, 5231113920, 3894932448, 1698920916, 483004280, 94092515, 12830664, 1225983, 80520, 3465, 88, 1;

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

P[0, x_] := 12 + 7*x + x^2;
P[n_, x_] := P[n, x] = Expand[(n + 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 + 7*x + x^2; for(n = 1, N, my(i = n + 1); v[i] = (n + 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-a33c0ab38a356260
• 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-a33c0ab38a356260
• 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-a33c0ab38a356260

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 A007318 e-a33c0ab38a356260

  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 A007318

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