A001263 → basis A013611 → 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(16 + 128\,x + 256\,x^{2} - 16\,n - 128\,n x - 256\,n x^{2}\right)\,P_{n-2}(x) + \left(6 + 16\,x + 12\,n + 32\,n x\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 1\)
\(P_{1}(x) = 6 + 16\,x\)

Rows ?

nx0x1x2x3x4x5x6x7Pn(1)
011
161622
241208256505
330622565376409612034
42426233608192012288065536296122
52007623824011008002457600262144010485767486732
617148124171361385088041062400658636805347737616777216193620169
71500666244898081674677766191718401328087040163682713610569646082684354565102944330
Technical details
Node id
n-34aaa5280b9f54d9 · revision 0 · JSON
Definition source
derived:basis_map_A013611
Fingerprint
f6-935f0bc54b4916f9

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,         16;
  2:        41,        208,         256;
  3:       306,       2256,        5376,         4096;
  4:      2426,      23360,       81920,       122880,        65536;
  5:     20076,     238240,     1100800,      2457600,      2621440,      1048576;
  6:    171481,    2417136,    13850880,     41062400,     65863680,     53477376,      16777216;
  7:   1500666,   24489808,   167467776,    619171840,   1328087040,   1636827136,    1056964608,    268435456;
  8:  13386206,  248177536,  1971859456,   8736587776,  23489019904,  38960889856,   38520487936,  20401094656,   4294967296;
  9: 121267476, 2517297120, 22786467840, 117683650560, 380606349312, 794969505792, 1064011038720, 869730877440, 386547056640, 68719476736;
%F Formula
The row polynomials satisfy (n+2)*P(n,x) = -(16*n-16+(128*n-128)*x+(256*n-256)*x^2)*P(n-2,x) + (12*n+6+(32*n+16)*x)*P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 6 + 16*x.
%t Mathematica
P[0, x_] := 1;
P[1, x_] := 6 + 16*x;
P[n_, x_] := P[n, x] = Expand[Together[(-(16*n - 16 + (128*n - 128)*x + (256*n - 256)*x^2)*P[n - 2, x] + (12*n + 6 + (32*n + 16)*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] = 6 + 16*x; for(n = 2, N, my(i = n + 1); v[i] = (-(16*n - 16 + (128*n - 128)*x + (256*n - 256)*x^2)*v[i - 2] + (12*n + 6 + (32*n + 16)*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