A114656 → basis A013609

OEIS matches ?

• A269730: row sums, 15 terms agree OEIS nonn (row-sum match: finite agreement only) · view at the OEIS · generated b-file 200 terms from n = 1 ?

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:      3,       2;
   3:     11,      16,        4;
   4:     45,     102,       60,        8;
   5:    197,     608,      584,      192,       16;
   6:    903,    3530,     4760,     2640,      560,      32;
   7:   4279,   20256,    35340,    28160,    10320,    1536,      64;
   8:  20793,  115598,   248052,   260120,   139440,   36512,    4032,    128;
   9: 103049,  658048,  1678096,  2192512,  1568224,  609280,  120064,  10240,   256;
  10: 518859, 3742290, 11064240, 17354400, 15634080, 8197056, 2424576, 373248, 25344, 512;

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

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

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

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

  Geometric basis map (elementary) polytool ?

  • premise (sequence): Triangle read by rows: T(n,k) is the number of double rise-bicolored Dyck paths (double rises come in two colors; also …
    uses: Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, 0]
    • theorem_check three_term_recurrence e-e6c0603bd7c28948 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