A085841 → basis A013609

nonnegative coefficients

Proved for all n: all roots real, in (−∞, 0] · coefficients of one sign · interlacing (weak) · Hadamard kernel what this means

Recurrence
\(P_{n}(x) = \left(-9 - 48\,x - 64\,x^{2}\right)\,P_{n-2}(x) + \left(10 + 16\,x\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 1\)
\(P_{1}(x) = 7 + 8\,x\)

Rows ?

nx0x1x2x3x4x5x6x7Pn(1)
011
17815
26114464269
3547200821125125179
449212460841856266244096102105
544287280488661888701440307200327682028071
6398581305579292338561378099210301440334233626214440375141
7358722732285048118976448229516800244715520138313728348651522097152804357075

Computed in your browser ?

Technical details
Node id
n-393cac5827041b9e · revision 1 · JSON
Definition source
derived:basis_map_A013609
Fingerprint
f6-51bc43062169a582

Observed on the stored rows ?

  • Degrees: 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14 (affine: slope 1, intercept 0)
  • Palindromic rows: no
  • γ-positive (gamma_positive): no
  • Nonnegative coefficients (nonn): yes
  • Only rational roots (rr_by_factors: every nonzero row is a product of linear factors over ℚ): no

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.

The atlas's own rows: n = 0, …, ascending powers of x
%e Example
Triangle begins:
  0:         1;
  1:         7,          8;
  2:        61,        144,          64;
  3:       547,       2008,        2112,         512;
  4:      4921,      24608,       41856,       26624,        4096;
  5:     44287,     280488,      661888,      701440,      307200,       32768;
  6:    398581,    3055792,     9233856,    13780992,    10301440,     3342336,      262144;
  7:   3587227,   32285048,   118976448,   229516800,   244715520,   138313728,    34865152,     2097152;
  8:  32285041,  333612096,  1451033344,  3435966464,  4774256640,  3892051968,  1739587584,   352321536,   16777216;
  9: 290565367, 3389929288, 16998074112, 47733434368, 81884291072, 87628382208, 57054068736, 20812136448, 3472883712, 134217728;
%F Formula
The row polynomials satisfy P(n,x) = -(9+48*x+64*x^2)*P(n-2,x) + (10+16*x)*P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 7 + 8*x.
%t Mathematica
P[0, x_] := 1;
P[1, x_] := 7 + 8*x;
P[n_, x_] := P[n, x] = Expand[-(9 + 48*x + 64*x^2)*P[n - 2, x] + (10 + 16*x)*P[n - 1, x]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten
%o PARI/GP
P(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = 7 + 8*x; for(n = 2, N, my(i = n + 1); v[i] = -(9 + 48*x + 64*x^2)*v[i - 2] + (10 + 16*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)

Generated with polytool c48629374597.

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-b4660546a5e77fa6
  • 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-b4660546a5e77fa6
  • 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-b4660546a5e77fa6
  • 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-b4660546a5e77fa6

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

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