A111125 → basis A013609

OEIS matches ?

• A030221: 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:
   1:    1;
   2:    4,     2;
   3:   11,    14,      4;
   4:   29,    62,     40,      8;
   5:   76,   230,    240,    104,     16;
   6:  199,   780,   1140,    784,    256,     32;
   7:  521,  2508,   4740,   4528,   2320,    608,     64;
   8: 1364,  7786,  18096,  22280,  15760,   6432,   1408,   128;
   9: 3571, 23578,  65120,  98504,  89520,  50208,  17024,  3200,  256;
  10: 9349, 70090, 224420, 403472, 449808, 323232, 150080, 43520, 7168, 512;

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

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

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

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-0d48af5cb3d93d03

  Geometric basis map (elementary) polytool ?

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

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

    • theorem_check three_term_recurrence e-19ca7a5e6e7a3cfc 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