A039755 → x ↦ x+1

OEIS matches ?

• A126390: 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 ?

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,       1;
   3:       6,       6,       1;
   4:      24,      34,      12,       1;
   5:     116,     208,     112,      20,       1;
   6:     648,    1396,    1000,     280,      30,      1;
   7:    4088,   10232,    9076,    3480,     590,     42,     1;
   8:   28640,   81320,   85568,   41636,    9800,   1106,    56,    1;
   9:  219920,  696192,  844544,  497056,  150696,  23744,  1904,   72,  1;
  10: 1832224, 6382864, 8745792, 6026560, 2241456, 458472, 51408, 3072, 90, 1;

The row polynomials satisfy P(n,x) = (2+x)*P(n-1,x) + (2+2*x)*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 + x)*P[n - 1, x] + (2 + 2*x)*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 + x)*v[i - 1] + (2 + 2*x)*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)

Proved properties

• Real-rooted. Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, -1]
  Every polynomial of the sequence has only real roots, inside the stated interval.
  by the cited steps: e-25255a5163ba8ab9
• 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-25255a5163ba8ab9
• 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-25255a5163ba8ab9
• Interlacing of consecutive rows. Rows P_(m-1), P_m interlace (weak, unordered) for every m >= 2
  The roots of consecutive polynomials alternate on the real line.
  by the cited steps: e-25255a5163ba8ab9

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

• preserver_image affine, shift 0 e-25255a5163ba8ab9

  Affine, reversal and Möbius substitutions (elementary) polytool ?

  • premise (sequence): Triangle of B-analogs of Stirling numbers of the second kind.
    uses: Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, 0]
    • theorem_check liu_wang e-c873e8cf4f19d199 root: theorem check

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

Related sequences ?

Same fingerprint (1)

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

• A039756 → x ↦ x/(x+1)

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