A173018 → reverse (shift +1) → D+1

OEIS matches ?

• A038720: row sums, 14 terms agree OEIS nonn (row-sum match: finite agreement only) · view at the OEIS · generated b-file 200 terms from n = 1 ?

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:
  0: 1;
  1: 1,    1;
  2: 1,    3,     1;
  3: 1,    9,     7,      1;
  4: 1,   23,    44,     15,      1;
  5: 1,   53,   224,    170,     31,      1;
  6: 1,  115,   963,   1510,    587,     63,      1;
  7: 1,  241,  3693,  10855,   8371,   1911,    127,     1;
  8: 1,  495, 13126,  66769,  93714,  41377,   6022,   255,   1;
  9: 1, 1005, 44326, 367544, 869184, 685594, 190490, 18624, 511, 1;

The row polynomials satisfy (n-2+2*x)*P(n,x) = -((n^3-5*n^2+7*n-3)*x^2+(3*n^2-10*n+7)*x^3+(2*n-2)*x^4)*P(n-2,x) - ((n^2-3*n+2)*x^2-(n^2-6*n+7)*x^3-(3*n-7)*x^4-2*x^5)*d/dx P(n-2,x) + (n-2+(2*n^2-7*n+8)*x+(5*n-9)*x^2+2*x^3)*P(n-1,x) + ((n-2)*x-(n-4)*x^2-2*x^3)*d/dx P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 1 + x.

P[0, x_] := 1;
P[1, x_] := 1 + x;
P[n_, x_] := P[n, x] = Expand[Together[(-((n^3 - 5*n^2 + 7*n - 3)*x^2 + (3*n^2 - 10*n + 7)*x^3 + (2*n - 2)*x^4)*P[n - 2, x] - ((n^2 - 3*n + 2)*x^2 - (n^2 - 6*n + 7)*x^3 - (3*n - 7)*x^4 - 2*x^5)*D[P[n - 2, x], x] + (n - 2 + (2*n^2 - 7*n + 8)*x + (5*n - 9)*x^2 + 2*x^3)*P[n - 1, x] + ((n - 2)*x - (n - 4)*x^2 - 2*x^3)*D[P[n - 1, x], x])/(n - 2 + 2*x)]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten

P(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = 1 + x; for(n = 2, N, my(i = n + 1); v[i] = (-((n^3 - 5*n^2 + 7*n - 3)*x^2 + (3*n^2 - 10*n + 7)*x^3 + (2*n - 2)*x^4)*v[i - 2] - ((n^2 - 3*n + 2)*x^2 - (n^2 - 6*n + 7)*x^3 - (3*n - 7)*x^4 - 2*x^5)*deriv(v[i - 2], x) + (n - 2 + (2*n^2 - 7*n + 8)*x + (5*n - 9)*x^2 + 2*x^3)*v[i - 1] + ((n - 2)*x - (n - 4)*x^2 - 2*x^3)*deriv(v[i - 1], x))/(n - 2 + 2*x)); 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-bb4a78f786290f50
• 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-bb4a78f786290f50
• 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-bb4a78f786290f50

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 derivative_polynomial, shift 0 e-bb4a78f786290f50

  Laguerre’s theorem on differential operators [SP14] polytool ?

  • premise (sequence): Triangle of Eulerian numbers T(n,k), 0 <= k <= n, read by rows.
    uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
    • preserver_image reversal, shift 1 e-61bc78adfe1eb25a

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

      • premise (sequence): Euler's triangle: triangle of Eulerian numbers T(n,k) (n>=0, 0 <= k <= n) read by rows.
        uses: Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, 0]
        • theorem_check liu_wang e-083b494dcfd2f637 root: theorem check

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

        • parent_provers root_domain e-ffc8a9fffd6e96cb 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.

• A334218 → D+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
2. [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.