A091044 → D

OEIS matches ?

• A002699: 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:
  0:   0;
  1:   2;
  2:  10,     6;
  3:  28,    56,     12;
  4:  60,   252,    180,     20;
  5: 110,   792,   1188,    440,     30;
  6: 182,  2002,   5148,   4004,    910,     42;
  7: 280,  4368,  17160,  22880,  10920,   1680,    56;
  8: 408,  8568,  47736,  97240,  79560,  25704,  2856,   72;
  9: 570, 15504, 116280, 335920, 419900, 232560, 54264, 4560, 90;

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

P[0, x_] := 0;
P[1, x_] := 2;
P[n_, x_] := P[n, x] = Expand[Together[((2*n^2 + 3*n + 1 + (6*n^2 - 7*n - 1)*x)*P[n - 1, x] + (4*n*x - 4*n*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] = 2; for(n = 2, N, my(i = n + 1); v[i] = ((2*n^2 + 3*n + 1 + (6*n^2 - 7*n - 1)*x)*v[i - 1] + (4*n*x - 4*n*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)

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-ce1e9db86c77ffa5
• 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-ce1e9db86c77ffa5
• 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-ce1e9db86c77ffa5
• Interlacing of consecutive rows. Rows P_(m-1), P_m interlace (weak, unordered) for every m >= 1
  The roots of consecutive polynomials alternate on the real line.
  by the cited steps: e-ce1e9db86c77ffa5

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

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

  • premise (sequence): One half of odd-numbered entries of even-numbered rows of Pascal's triangle A007318.
    uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
    • theorem_check three_term_recurrence e-4ffbabf9b60188a8 root: theorem check

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

    • preserver_image reversal, shift 0 e-75f779345b39f910

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

      • premise (sequence): One half of odd-numbered entries of even-numbered rows of Pascal's triangle A007318.
        uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
        • ↵ theorem_check three_term_recurrence e-4ffbabf9b60188a8 (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