A082985 → basis A013609

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:
  0:    1;
  1:    4,     6;
  2:   11,    30,     20;
  3:   29,   112,    140,      56;
  4:   76,   378,    684,     528,     144;
  5:  199,  1210,   2860,    3256,    1760,     352;
  6:  521,  3744,  10920,   16432,   13312,    5408,     832;
  7: 1364, 11310,  39240,   73440,   79440,   49056,   15680,   1920;
  8: 3571, 33558, 134980,  302192,  409360,  340544,  167552,  43520,   4352;
  9: 9349, 98192, 449236, 1170856, 1906688, 1998496, 1335168, 539904, 116736, 9728;

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

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

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 A013609 e-6e851e1d33c90855

  Geometric basis map (elementary) polytool ?

  • premise (sequence): Coefficient table for Chebyshev's U(2*n,x) polynomial expanded in decreasing powers of (-4*(1-x^2)).
    uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
    • theorem_check three_term_recurrence e-4fa62233b528a616 root: theorem check

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

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