A103327 → reverse → D

Matches ?

No OEIS matches.

Submission text ?

Triangle begins:
  0:   0;
  1:   3;
  2:  10,   10;
  3:  21,   70,    21;
  4:  36,  252,   252,     36;
  5:  55,  660,  1386,    660,     55;
  6:  78, 1430,  5148,   5148,   1430,     78;
  7: 105, 2730, 15015,  25740,  15015,   2730,   105;
  8: 136, 4760, 37128,  97240,  97240,  37128,  4760,  136;
  9: 171, 7752, 81396, 302328, 461890, 302328, 81396, 7752, 171;

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

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

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

Properties

• Real-rooted? Every row P_n, n ≥ 0, is zero or real-rooted with all roots in (−∞, 0]
  by Laguerre’s theorem on differential operators
• Coefficients of one sign? Every nonzero row, n ≥ 0: the coefficients of P_n have one sign
  derived from Laguerre’s theorem on differential operators
• Hadamard kernel (Malo)? Rows P_n, n ≥ 0, are Hadamard kernels (preserve real-rootedness)
  derived from Laguerre’s theorem on differential operators
• Interlacing of consecutive rows? Rows P_(m-1), P_m interlace (weak, unordered) for every m ≥ 1
  by Laguerre’s theorem on differential operators

Proof chains ? JSON

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

  • from reversal of Triangle read by rows: T(n,k) = binomial(2n+1, 2k+1).?
    • Affine, reversal and Möbius substitutions (elementary) polytool ? step ›

      • from Triangle read by rows: T(n,k) = binomial(2n+1, 2k+1).?
        • Liu–Wang theorem for three-term recurrences [LW07, Thm 2.1, Thm 2.3, Cor 2.4, Prop 3.3] polytool ? step › direct check
        • Three-term recurrence criterion [Sze39, §3.3; Fav35] polytool ? step › direct check
        • Affine, reversal and Möbius substitutions (elementary) polytool ? step ›

          • from reversal of Triangle read by rows: T(n,k) = binomial(2n+1, 2k+1).?
            • Affine, reversal and Möbius substitutions (elementary) polytool ? step ›

              • from Triangle read by rows: T(n,k) = binomial(2n+1, 2k+1).?
                • ↑ Liu–Wang theorem for three-term recurrences (above)
                • ↑ Three-term recurrence criterion (above)
    • ↑ Affine, reversal and Möbius substitutions (elementary) (above)

Related ?

Same fingerprint ?

• A034870 → Veronese 2 (j=1)
• A091042 → D
• A091044: One half of odd-numbered entries of even-numbered rows of Pascal's triangle A007318.

References

1. [Fav35] Jean Favard. Sur les polynômes de tchebicheff. C. R. Acad. Sci. Paris, 200:2052–2053, 1935.
2. [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
3. [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.
4. [Sze39] G. Szegő. Orthogonal Polynomials. Colloquium publications, American Mathematical Society, 1939. doi:10.1090/coll/023