A063007 → D+1

OEIS matches ?

No OEIS matches.

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:  3,    2;
   3:  7,   18,     6;
   4: 13,   72,    90,     20;
   5: 21,  200,   510,    420,      70;
   6: 31,  450,  1890,   3080,    1890,     252;
   7: 43,  882,  5460,  14280,   17010,    8316,     924;
   8: 57, 1568, 13356,  50400,   94710,   88704,   36036,    3432;
   9: 73, 2592, 28980, 147840,  395010,  576576,  444444,  154440,  12870;
  10: 91, 4050, 57420, 378840, 1351350, 2774772, 3303300, 2162160, 656370, 48620;

The row polynomials satisfy (n^3-4*n^2+6*n-3+(n-1)*x-(n-1)*x^2)*P(n,x) = (n^3-2*n^2+2*n-1+(2*n^3-4*n^2+3*n-1)*x-(n-1)*x^2-(2*n-2)*x^3)*P(n-1,x) + ((2*n^2-4*n+2)*x+(2*n^2-4*n)*x^2-4*x^3-2*x^4)*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[Together[((n^3 - 2*n^2 + 2*n - 1 + (2*n^3 - 4*n^2 + 3*n - 1)*x - (n - 1)*x^2 - (2*n - 2)*x^3)*P[n - 1, x] + ((2*n^2 - 4*n + 2)*x + (2*n^2 - 4*n)*x^2 - 4*x^3 - 2*x^4)*D[P[n - 1, x], x])/(n^3 - 4*n^2 + 6*n - 3 + (n - 1)*x - (n - 1)*x^2)]];
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] = ((n^3 - 2*n^2 + 2*n - 1 + (2*n^3 - 4*n^2 + 3*n - 1)*x - (n - 1)*x^2 - (2*n - 2)*x^3)*v[i - 1] + ((2*n^2 - 4*n + 2)*x + (2*n^2 - 4*n)*x^2 - 4*x^3 - 2*x^4)*deriv(v[i - 1], x))/(n^3 - 4*n^2 + 6*n - 3 + (n - 1)*x - (n - 1)*x^2)); 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, 0]
  Every polynomial of the sequence has only real roots, inside the stated interval.
  by the cited steps: e-fe7d8cfc9bd8202a
• 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-fe7d8cfc9bd8202a
• 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-fe7d8cfc9bd8202a
• 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-fe7d8cfc9bd8202a

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-fe7d8cfc9bd8202a

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

  • premise (sequence): T(n,k) = binomial(n,k)*binomial(n+k,k), 0 <= k <= n, triangle read by rows.
    uses: Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, 0]
    • theorem_check three_term_recurrence e-18de01688f1c88b0 root: theorem check

      Three-term recurrence criterion [Sze39, §3.3; Fav35] polytool ?

    • theorem_check three_term_recurrence e-93f30859d3148f4f root: theorem check

      Three-term recurrence criterion [Sze39, §3.3; Fav35] polytool ?

    • preserver_image reversal, shift 0 e-00d47151fcd2720e

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

      • premise (sequence): Triangle read by rows: T(n,k) is the number of lattice paths from (0,0) to (n,n) using steps E=(1,0), N=(0,1) and D=(1,…
        uses: Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, 0]
        • theorem_check three_term_recurrence e-74c20febd3423e2e root: theorem check

          Three-term recurrence criterion [Sze39, §3.3; Fav35] polytool ?

        • preserver_image reversal, shift 0 e-5047c71cb920acb6

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

          • premise (sequence): T(n,k) = binomial(n,k)*binomial(n+k,k), 0 <= k <= n, triangle read by rows.
            uses: Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, 0]
            • ↵ theorem_check three_term_recurrence e-18de01688f1c88b0 (expanded above)
            • ↵ theorem_check three_term_recurrence e-93f30859d3148f4f (expanded above)

Related sequences ?

No candidate equalities or related sequences.

References

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