A094816 → basis A013611 → basis A013609

nonnegative coefficients

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

Recurrence

\(P_{n}(x) = \left(2 - n\right)\,P_{n-2}(x) + \left(4 + 8\,x + n\right)\,P_{n-1}(x)\)
\(P_{1}(x) = 1\)
\(P_{2}(x) = 6 + 8\,x\)

Rows ?

nx0x1x2x3x4x5x6x7Pn(1)
111
26814
34110464209
4316114413445123316
52721125122105615360409655745
62594614231230528032000016384032768990146
72718011710440439129658854404341760167116826214418534049
8310593621845816645473921038356489820160054591488165150722097152364740104
Technical details
Node id
n-5274303620790a5b · revision 0 · JSON
Definition source
derived:basis_map_A013609
Fingerprint
f6-06bef811e69a5ce3

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 -1)
  • 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 = 1, …, ascending powers of x
%e Example
Triangle begins:
   1:         1;
   2:         6,          8;
   3:        41,        104,          64;
   4:       316,       1144,        1344,         512;
   5:      2721,      12512,       21056,       15360,        4096;
   6:     25946,     142312,      305280,      320000,      163840,       32768;
   7:    271801,    1710440,     4391296,     5885440,     4341760,     1671168,      262144;
   8:   3105936,   21845816,    64547392,   103835648,    98201600,    54591488,    16515072,    2097152;
   9:  38474561,  296870016,   983143552,  1825044480,  2076913664,  1483603968,   649592832,  159383552,   16777216;
  10: 513796366, 4289210184, 15622590720, 32585085952, 42891534336, 36949032960, 20831010816, 7411335168, 1509949440, 134217728;
%F Formula
The row polynomials satisfy P(n,x) = -(n-2)*P(n-2,x) + (n+4+8*x)*P(n-1,x) for n >= 3, with P(1,x) = 1, P(2,x) = 6 + 8*x.
%t Mathematica
P[1, x_] := 1;
P[2, x_] := 6 + 8*x;
P[n_, x_] := P[n, x] = Expand[-(n - 2)*P[n - 2, x] + (n + 4 + 8*x)*P[n - 1, x]];
Table[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten
%o PARI/GP
P(N) = {my(v = vector(N)); v[1] = 1; v[2] = 6 + 8*x; for(n = 3, N, my(i = n); v[i] = -(n - 2)*v[i - 2] + (n + 4 + 8*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, v[i])))};
T(10)

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