A103327 → 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) = 6 + 8\,x\)

Rows ?

nx0x1x2x3x4x5x6x7Pn(1)
011
16814
24412864236
3328150419205124264
42448153603225624576409678736
518272145536427008552960286720327681463264
61363841316864496742491422728273920314572826214427244736
710179841155020853274624127426560166297600112852992330301442097152507547264
Technical details
Node id
n-5789a92bc35b10b8 · revision 0 · JSON
Definition source
derived:basis_map_A013611
Fingerprint
f6-c6a8e415ca4396df

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:        6,         8;
  2:       44,       128,         64;
  3:      328,      1504,       1920,         512;
  4:     2448,     15360,      32256,       24576,        4096;
  5:    18272,    145536,     427008,      552960,      286720,       32768;
  6:   136384,   1316864,    4967424,     9142272,     8273920,     3145728,      262144;
  7:  1017984,  11550208,   53274624,   127426560,   166297600,   112852992,    33030144,     2097152;
  8:  7598336,  99057664,  540262400,  1592000512,  2725642240,  2701131776,  1438646272,   335544320,   16777216;
  9: 56714752, 835258368, 5259165696, 18426494976, 39124729856, 51291095040, 40340815872, 17414750208, 3321888768, 134217728;
%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) = 6 + 8*x.
%t Mathematica
P[0, x_] := 1;
P[1, x_] := 6 + 8*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] = 6 + 8*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