A088617 → basis A013611

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 - 24\,x + 6\,n + 16\,n x\right)\,P_{n-1}(x)\)
\(P_{1}(x) = 1\)
\(P_{2}(x) = 2 + 4\,x\)

Rows ?

nx0x1x2x3x4x5x6x7Pn(1)
111
2246
36283266
422164400320906
59092435045824358413926
6394515626656680968601643008229326
7180628732188480652800125952012840965406723956106
8855816032412756965590080145728002260684819329024702873670572066
Technical details
Node id
n-39310b120a1d8578 · revision 0 · JSON
Definition source
derived:basis_map_A013611
Fingerprint
f6-2eec2e552ea6c0fc

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,       4;
   3:      6,      28,       32;
   4:     22,     164,      400,       320;
   5:     90,     924,     3504,      5824,       3584;
   6:    394,    5156,    26656,     68096,      86016,      43008;
   7:   1806,   28732,   188480,    652800,    1259520,    1284096,     540672;
   8:   8558,  160324,  1275696,   5590080,   14572800,   22606848,   19329024,    7028736;
   9:  41586,  896572,  8390480,  44524480,  146558720,  306482176,  397709312,  292864000,   93716480;
  10: 206098, 5025860, 54091840, 337272320, 1342781440, 3540432896, 6182944768, 6897532928, 4460904448, 1274544128;
%F Formula
The row polynomials satisfy n*P(n,x) = -(n-3)*P(n-2,x) + (6*n-9+(16*n-24)*x)*P(n-1,x) for n >= 3, with P(1,x) = 1, P(2,x) = 2 + 4*x.
%t Mathematica
P[1, x_] := 1;
P[2, x_] := 2 + 4*x;
P[n_, x_] := P[n, x] = Expand[Together[(-(n - 3)*P[n - 2, x] + (6*n - 9 + (16*n - 24)*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 + 4*x; for(n = 3, N, my(i = n); v[i] = (-(n - 3)*v[i - 2] + (6*n - 9 + (16*n - 24)*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

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.