A173018 → reverse (shift +1) → reverse → x ↦ x+1

Matches ?

No OEIS matches.

Submission text ?

Triangle begins:
  0:      1;
  1:      1;
  2:      2,       1;
  3:      6,       6,       1;
  4:     24,      36,      14,       1;
  5:    120,     240,     150,      30,      1;
  6:    720,    1800,    1560,     540,     62,      1;
  7:   5040,   15120,   16800,    8400,   1806,    126,     1;
  8:  40320,  141120,  191520,  126000,  40824,   5796,   254,   1;
  9: 362880, 1451520, 2328480, 1905120, 834120, 186480, 18150, 510, 1;

The row polynomials satisfy P(n,x) = (n+(n-1)*x)*P(n-1,x) - (x+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[(n + (n - 1)*x)*P[n - 1, x] - (x + x^2)*D[P[n - 1, x], x]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten

P(N) = {my(v = vector(N + 1)); v[1] = 1; for(n = 1, N, my(i = n + 1); v[i] = (n + (n - 1)*x)*v[i - 1] - (x + 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 - 1, v[i])))};
T(9)

Properties

• Real-rooted? Every row P_n, n ≥ 0, is zero or real-rooted with all roots in (−∞, -1]
  by Affine, reversal and Möbius substitutions (elementary)
• Coefficients of one sign? Every nonzero row, n ≥ 0: the coefficients of P_n have one sign
  derived from Affine, reversal and Möbius substitutions (elementary)
• Hadamard kernel (Malo)? Rows P_n, n ≥ 0, are Hadamard kernels (preserve real-rootedness)
  derived from Affine, reversal and Möbius substitutions (elementary)
• Interlacing of consecutive rows? Rows P_(m-1), P_m interlace (weak, unordered) for every m ≥ 1
  by Affine, reversal and Möbius substitutions (elementary)

Proof chains ? JSON

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

  • from reversal of Triangle of Eulerian numbers T(n,k), 0 <= k <= n, read by rows.?
    • Affine, reversal and Möbius substitutions (elementary) polytool ? step ›

      • from Triangle of Eulerian numbers T(n,k), 0 <= k <= n, read by rows.?
        • Affine, reversal and Möbius substitutions (elementary) polytool ? step ›

          • from Euler's triangle: triangle of Eulerian numbers T(n,k) (n>=0, 0 <= k <= n) read by rows.?
            • Liu–Wang theorem [LW07, Thm 2.1, Cor 2.4] ? step › direct check
            • Parent-row provers of polytool polytool ? step › direct check
            • Parent-row provers of polytool polytool ? step › direct check
        • Affine, reversal and Möbius substitutions (elementary) polytool ? step ›

          • from Euler's triangle: triangle of Eulerian numbers T(n,k) (n>=0, 0 <= k <= n) read by rows.?
            • ↑ Liu–Wang theorem (above)
            • ↑ Parent-row provers of polytool (above)
            • ↑ Parent-row provers of polytool (above)
    • Affine, reversal and Möbius substitutions (elementary) polytool ? step ›

      • from Triangle of Eulerian numbers T(n,k), 0 <= k <= n, read by rows.?
        • ↑ Affine, reversal and Möbius substitutions (elementary) (above)
        • ↑ Affine, reversal and Möbius substitutions (elementary) (above)

Related ?

Same fingerprint ?

• A173018 → x ↦ x+1
• A090582: T(n, k) = Sum_{j=0..n-k} (-1)^j*binomial(n - k + 1, j)*(n - k + 1 - j)^n. Triangle read by rows, T(n, k) for 1…
• A019538: Triangle of numbers T(n,k) = k!*Stirling2(n,k) read by rows (n >= 1, 1 <= k <= n).
• A257609 → x ↦ x+1
• A028246 → θ+1
• A257620 → x ↦ x+1
• A257609 → x ↦ x/(x+1)
• A163626 → x ↦ x+1
• row-factor cofactor of A101842 → x ↦ x/(x+1)
• A008292 → x ↦ x+1
• A257620 → x ↦ x/(x+1)
• A131689: Triangle of numbers T(n,k) = k!*Stirling2(n,k) = A000142(k)*A048993(n,k) read by rows, T(n, k) for 0 <= k <= n.
• A173018 → reverse (shift +1) → 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