A108838 → basis A013611

nonnegative coefficients

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

Recurrence
\(\left(3 + 7\,n + 2\,n^{2}\right)\,P_{n}(x) = \left(48\,x^{2} - 16\,n x^{2} - 32\,n^{2} x^{2}\right)\,P_{n-2}(x) + \left(6 + 16\,n + 32\,n x + 8\,n^{2} + 16\,n^{2} x\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 2\)
\(P_{1}(x) = 5 + 8\,x\)

Rows ?

nx0x1x2x3x4x5x6x7Pn(1)
022
15813
214483294
342224336128730
4132960230420485125956
54293960132001920011520204850357
614301601668640140800140800614408192437318
74862640643363368968961281280946176315392327683877774

Computed in your browser ?

Technical details
Node id
n-5edf2b863e61c4aa · revision 1 · JSON
Definition source
derived:basis_map_A013611
Fingerprint
f6-6c7cd585ae759b21

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:     2;
  1:     5,       8;
  2:    14,      48,      32;
  3:    42,     224,     336,      128;
  4:   132,     960,    2304,     2048,      512;
  5:   429,    3960,   13200,    19200,    11520,     2048;
  6:  1430,   16016,   68640,   140800,   140800,    61440,     8192;
  7:  4862,   64064,  336336,   896896,  1281280,   946176,   315392,    32768;
  8: 16796,  254592, 1584128,  5218304,  9784320, 10436608,  5963776,  1572864,  131072;
  9: 58786, 1007760, 7255872, 28514304, 66533376, 93929472, 78274560, 35782656, 7667712, 524288;
%F Formula
The row polynomials satisfy (2*n^2+7*n+3)*P(n,x) = -(32*n^2+16*n-48)*x^2*P(n-2,x) + (8*n^2+16*n+6+(16*n^2+32*n)*x)*P(n-1,x) for n >= 2, with P(0,x) = 2, P(1,x) = 5 + 8*x.
%t Mathematica
P[0, x_] := 2;
P[1, x_] := 5 + 8*x;
P[n_, x_] := P[n, x] = Expand[Together[(-(32*n^2 + 16*n - 48)*x^2*P[n - 2, x] + (8*n^2 + 16*n + 6 + (16*n^2 + 32*n)*x)*P[n - 1, x])/(2*n^2 + 7*n + 3)]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten
%o PARI/GP
P(N) = {my(v = vector(N + 1)); v[1] = 2; v[2] = 5 + 8*x; for(n = 2, N, my(i = n + 1); v[i] = (-(32*n^2 + 16*n - 48)*x^2*v[i - 2] + (8*n^2 + 16*n + 6 + (16*n^2 + 32*n)*x)*v[i - 1])/(2*n^2 + 7*n + 3)); 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-1d1dd7e155045a8b
  • 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-1d1dd7e155045a8b
  • 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-1d1dd7e155045a8b
  • 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-1d1dd7e155045a8b

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