A207824 → basis A007318

OEIS matches ?

• A004187: row sums, 15 terms agree OEIS nonn (row-sum match: finite agreement only) · view at the OEIS

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:       6,        1;
  2:      35,       12,       1;
  3:     204,      106,      18,       1;
  4:    1189,      828,     213,      24,      1;
  5:    6930,     6051,    2088,     356,     30,      1;
  6:   40391,    42408,   18366,    4200,    535,     36,     1;
  7:  235416,   288788,  150516,   43210,   7380,    750,    42,    1;
  8: 1372105,  1925736, 1173518,  405576,  86955,  11844,  1001,   48,  1;
  9: 7997214, 12637733, 8816328, 3563764, 919926, 157269, 17808, 1288, 54, 1;

The row polynomials satisfy P(n,x) = -P(n-2,x) + (6+x)*P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 6 + x.

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

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

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

• basis_map A007318 e-7e402d8f3ce84882

  Geometric basis map (elementary) polytool ?

  • premise (sequence): Triangle of coefficients of Chebyshev's S(n,x+5) polynomials (exponents of x in increasing order).
    uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
    • theorem_check three_term_recurrence e-bc1afad92d84942a root: theorem check

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

    • theorem_check three_term_recurrence e-742fc3935df1d1d3 root: theorem check

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

    • preserver_image affine, shift 0 e-dbf8101c811237e4

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

      • premise (sequence): Triangle of coefficients of Chebyshev's S(n,x+4) polynomials (exponents of x in increasing order).
        uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-6, -2)
        • preserver_image affine, shift 0 e-56c0c02612a8191c

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

          • premise (sequence): A convolution triangle of numbers based on A001906 (even-indexed Fibonacci numbers).
            uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-5, -1)
            • theorem_check three_term_recurrence e-c7df247a48c8552e root: theorem check

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

        • theorem_check three_term_recurrence e-ec629e395a3def0c root: theorem check

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

    • basis_map A007318 e-785b355515669be0

      Geometric basis map (elementary) polytool ?

      • premise (sequence): Triangle of coefficients of Chebyshev's S(n,x+4) polynomials (exponents of x in increasing order).
        uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
        • theorem_check three_term_recurrence e-720cd5df5ac0e3b3 root: theorem check

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

        • ↵ preserver_image affine, shift 0 e-56c0c02612a8191c (expanded above)
        • ↵ theorem_check three_term_recurrence e-ec629e395a3def0c (expanded above)
        • basis_map A007318 e-9c2f7b8109ebb5e1

          Geometric basis map (elementary) polytool ?

          • premise (sequence): A convolution triangle of numbers based on A001906 (even-indexed Fibonacci numbers).
            uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
            • theorem_check three_term_recurrence e-af8f298ca8f41adf root: theorem check

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

            • ↵ theorem_check three_term_recurrence e-c7df247a48c8552e (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. [Sze39] G. Szegő. Orthogonal Polynomials. Colloquium publications, American Mathematical Society, 1939. doi:10.1090/coll/023