A008459 → basis A013611 → basis A013609

nonnegative coefficients

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

Recurrence

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

Rows ?

nx0x1x2x3x4x5x6x7Pn(1)
011
16814
24611264222
3396139215365123836
43606166082726418432409670006
533876193200422400435200204800327681322244
63245562208288603840083968006144000216268826214425536876
73151896249206728184422414353920014336000079822848220200962097152500756088
Technical details
Node id
n-46d4fc5d412f843f · revision 0 · JSON
Definition source
derived:basis_map_A013609
Fingerprint
f6-c7fd43eddec33253

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:        46,        112,          64;
  3:       396,       1392,        1536,         512;
  4:      3606,      16608,       27264,       18432,        4096;
  5:     33876,     193200,      422400,      435200,      204800,       32768;
  6:    324556,    2208288,     6038400,     8396800,     6144000,     2162688,      262144;
  7:   3151896,   24920672,    81844224,   143539200,   143360000,    79822848,    22020096,     2097152;
  8:  30915046,  278544832,  1068180736,  2263109632,  2871500800,  2203844608,   976224256,   218103808,   16777216;
  9: 305543556, 3090266928, 13554146304, 33674790912, 51881066496, 50911838208, 31356616704, 11400118272, 2113929216, 134217728;
%F Formula
The row polynomials satisfy n*P(n,x) = -(16*n-16+(64*n-64)*x+(64*n-64)*x^2)*P(n-2,x) + (12*n-6+(16*n-8)*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[Together[(-(16*n - 16 + (64*n - 64)*x + (64*n - 64)*x^2)*P[n - 2, x] + (12*n - 6 + (16*n - 8)*x)*P[n - 1, x])/(n)]];
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] = (-(16*n - 16 + (64*n - 64)*x + (64*n - 64)*x^2)*v[i - 2] + (12*n - 6 + (16*n - 8)*x)*v[i - 1])/(n)); 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. [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