A091044 → basis A013609 → basis A013611

nonnegative coefficients

Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernelinterlacing (weak)

Recurrence

\(P_{n}(x) = \left(-4 - 32\,x - 64\,x^{2}\right)\,P_{n-2}(x) + \left(8 + 16\,x\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 1\)
\(P_{1}(x) = 8 + 16\,x\)

Rows ?

nx0x1x2x3x4x5x6x7Pn(1)
011
181624
260224192476
34482432409620489024
4334423808599046144020480168976
52496021990473728011550728192001966083153024
618630419563528201216173506561915289610092544183500858774976
713905921695334485327872227737600343408640286261248117440512167772161095297024
Technical details
Node id
n-4e42e7338135b29f · revision 0 · JSON
Definition source
derived:basis_map_A013611
Fingerprint
f6-28aeaa2f5503f030

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

Matches ?

No OEIS matches.

Submission text ?

Atlas rows n = 0, …, ascending powers of x
%e Example
Triangle begins:
  0:        1;
  1:        8,         16;
  2:       60,        224,        192;
  3:      448,       2432,       4096,        2048;
  4:     3344,      23808,      59904,       61440,       20480;
  5:    24960,     219904,     737280,     1155072,      819200,       196608;
  6:   186304,    1956352,    8201216,    17350656,    19152896,     10092544,     1835008;
  7:  1390592,   16953344,   85327872,   227737600,   343408640,    286261248,   117440512,    16777216;
  8: 10379520,  144089088,  846544896,  2730098688,  5234360320,   6020923392,  3963617280,  1308622848,   150994944;
  9: 77473792, 1206472704, 8104968192, 30659051520, 71434240000, 105207824384, 96435437568, 51740934144, 14092861440, 1342177280;
%F Formula
The row polynomials satisfy P(n,x) = -(4+32*x+64*x^2)*P(n-2,x) + (8+16*x)*P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 8 + 16*x.
%t Mathematica
P[0, x_] := 1;
P[1, x_] := 8 + 16*x;
P[n_, x_] := P[n, x] = Expand[-(4 + 32*x + 64*x^2)*P[n - 2, x] + (8 + 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] = 8 + 16*x; for(n = 2, N, my(i = n + 1); v[i] = -(4 + 32*x + 64*x^2)*v[i - 2] + (8 + 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)

polytool c48629374597

Properties

Proof chains ? JSON

References

  1. [Fav35] Jean Favard. Sur les polynômes de tchebicheff. C. R. Acad. Sci. Paris, 200:2052–2053, 1935.
  2. [LW07] Lily L. Liu and Yi Wang. A unified approach to polynomial sequences with only real zeros. Advances in Applied Mathematics, 38(4):542–560, May 2007. doi:10.1016/j.aam.2006.02.003
  3. [Sze39] G. Szegő. Orthogonal Polynomials. Colloquium publications, American Mathematical Society, 1939. doi:10.1090/coll/023