A088617 → 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(3 - n\right)\,P_{n-2}(x) + \left(-9 - 12\,x + 6\,n + 8\,n x\right)\,P_{n-1}(x)\)
\(P_{1}(x) = 1\)
\(P_{2}(x) = 2 + 2\,x\)

Rows ?

nx0x1x2x3x4x5x6x7Pn(1)
111
2224
3614828
4228210040244
5904628767282242380
63942578666485125376134424868
7180614366471208160078720401288448272188
8855880162318924698760910800706464302016549123080596
Technical details
Node id
n-36f587956712a55a · revision 0 · JSON
Definition source
derived:basis_map_A013609
Fingerprint
f6-8419344160e8e665

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:      2,       2;
   3:      6,      14,        8;
   4:     22,      82,      100,       40;
   5:     90,     462,      876,      728,      224;
   6:    394,    2578,     6664,     8512,     5376,      1344;
   7:   1806,   14366,    47120,    81600,    78720,     40128,     8448;
   8:   8558,   80162,   318924,   698760,   910800,    706464,   302016,    54912;
   9:  41586,  448286,  2097620,  5565560,  9159920,   9577568,  6214208,  2288000,   366080;
  10: 206098, 2512930, 13522960, 42159040, 83923840, 110638528, 96608512, 53886976, 17425408, 2489344;
%F Formula
The row polynomials satisfy n*P(n,x) = -(n-3)*P(n-2,x) + (6*n-9+(8*n-12)*x)*P(n-1,x) for n >= 3, with P(1,x) = 1, P(2,x) = 2 + 2*x.
%t Mathematica
P[1, x_] := 1;
P[2, x_] := 2 + 2*x;
P[n_, x_] := P[n, x] = Expand[Together[(-(n - 3)*P[n - 2, x] + (6*n - 9 + (8*n - 12)*x)*P[n - 1, x])/(n)]];
Table[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten
%o PARI/GP
P(N) = {my(v = vector(N)); v[1] = 1; v[2] = 2 + 2*x; for(n = 3, N, my(i = n); v[i] = (-(n - 3)*v[i - 2] + (6*n - 9 + (8*n - 12)*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, v[i])))};
T(10)

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. [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. [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.