A001263 → basis A013609 → basis A013611

nonnegative coefficients

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

Recurrence

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

Rows ?

nx0x1x2x3x4x5x6x7Pn(1)
011
14812
2197264155
31005529605122124
456240641049611264409630482
533042952010112016384012288032768453432
6200712134329110401978880227328012779522621446936799
712499615412887878976214860803340288029130752128450562097152108507180
Technical details
Node id
n-68d8f115d76731e0 · revision 0 · JSON
Definition source
derived:basis_map_A013611
Fingerprint
f6-5f59e32223b7d8f5

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:       4,        8;
  2:      19,       72,        64;
  3:     100,      552,       960,        512;
  4:     562,     4064,     10496,      11264,       4096;
  5:    3304,    29520,    101120,     163840,     122880,      32768;
  6:   20071,   213432,    911040,    1978880,    2273280,    1277952,     262144;
  7:  124996,  1541288,   7878976,   21486080,   33402880,   29130752,   12845056,    2097152;
  8:  793774, 11133504,  66307584,  217749504,  427843584,  509214720,  352321536,  125829120,   16777216;
  9: 5120632, 80498160, 547361280, 2103091200, 5000970240, 7568031744, 7200571392, 4076863488, 1207959552, 134217728;
%F Formula
The row polynomials satisfy (n+2)*P(n,x) = -(4*n-4+(32*n-32)*x+(64*n-64)*x^2)*P(n-2,x) + (8*n+4+(16*n+8)*x)*P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 4 + 8*x.
%t Mathematica
P[0, x_] := 1;
P[1, x_] := 4 + 8*x;
P[n_, x_] := P[n, x] = Expand[Together[(-(4*n - 4 + (32*n - 32)*x + (64*n - 64)*x^2)*P[n - 2, x] + (8*n + 4 + (16*n + 8)*x)*P[n - 1, x])/(n + 2)]];
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] = 4 + 8*x; for(n = 2, N, my(i = n + 1); v[i] = (-(4*n - 4 + (32*n - 32)*x + (64*n - 64)*x^2)*v[i - 2] + (8*n + 4 + (16*n + 8)*x)*v[i - 1])/(n + 2)); 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

Same fingerprint ?

References

  1. [Bra15] Petter Brändén. Unimodality, log-concavity, real-rootedness and beyond. Handbook of enumerative combinatorics, :437–483, March 2015. doi:10.1201/b18255-10
  2. [Fav35] Jean Favard. Sur les polynômes de tchebicheff. C. R. Acad. Sci. Paris, 200:2052–2053, 1935.
  3. [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
  4. [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.
  5. [Sze39] G. Szegő. Orthogonal Polynomials. Colloquium publications, American Mathematical Society, 1939. doi:10.1090/coll/023