A085841 → basis A013611

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:         7,         16;
  2:        61,        288,         256;
  3:       547,       4016,        8448,         4096;
  4:      4921,      49216,      167424,       212992,         65536;
  5:     44287,     560976,     2647552,      5611520,       4915200,       1048576;
  6:    398581,    6111584,    36935424,    110247936,     164823040,     106954752,      16777216;
  7:   3587227,   64570096,   475905792,   1836134400,    3915448320,    4426039296,    2231369728,     268435456;
  8:  32285041,  667224192,  5804133376,  27487731712,   76388106240,  124545662976,  111333605376,   45097156608,   4294967296;
  9: 290565367, 6779858576, 67992296448, 381867474944, 1310148657152, 2804108230656, 3651460399104, 2663953465344, 889058230272, 68719476736;

The row polynomials satisfy P(n,x) = -(9+96*x+256*x^2)*P(n-2,x) + (10+32*x)*P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 7 + 16*x.

P[0, x_] := 1;
P[1, x_] := 7 + 16*x;
P[n_, x_] := P[n, x] = Expand[-(9 + 96*x + 256*x^2)*P[n - 2, x] + (10 + 32*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] = 7 + 16*x; for(n = 2, N, my(i = n + 1); v[i] = -(9 + 96*x + 256*x^2)*v[i - 2] + (10 + 32*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-cc801bbe6c76dcc1
• 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-cc801bbe6c76dcc1
• 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-cc801bbe6c76dcc1
• 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-cc801bbe6c76dcc1

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 A013611 e-cc801bbe6c76dcc1

  Geometric basis map (elementary) polytool ?

  • premise (sequence): Triangle: row #n has n+1 terms. T(n,m) = 4^m (2n+1)! / ( (2n-2m)! (2m+1)! ).
    uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
    • theorem_check three_term_recurrence e-c0dcd56725ae4481 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