A386789 → basis A013609

nonnegative coefficients

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

Recurrence

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

Rows ?

nx0x1x2x3x4x5x6x7Pn(1)
011
1246
29302463
344208320160732
422513803120308011208925
5118289162654438976282248064111906
6632156602208880406560440160251328591361428987
7342323548801562112378432054489604663296219648043929618483576
Technical details
Node id
n-0ac4554fdfe0fde7 · revision 0 · JSON
Definition source
derived:basis_map_A013609
Fingerprint
f6-50189a7221320c9f

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:       2,        4;
  2:       9,       30,       24;
  3:      44,      208,      320,       160;
  4:     225,     1380,     3120,      3080,      1120;
  5:    1182,     8916,    26544,     38976,     28224,      8064;
  6:    6321,    56602,   208880,    406560,    440160,    251328,     59136;
  7:   34232,   354880,  1562112,   3784320,   5448960,   4663296,   2196480,    439296;
  8:  187137,  2204424, 11269440,  32654160,  58655520,  66882816,  47279232,  18944640,   3294720;
  9: 1030490, 13595140, 79148960, 266875840, 574333760, 818097280, 771330560, 464189440, 161807360, 24893440;
%F Formula
The row polynomials satisfy (n^2-n)*P(n,x) = -(n^2-2*n)*P(n-2,x) + (6*n^2-9*n+3+(8*n^2-12*n+4)*x)*P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 2 + 4*x.
%t Mathematica
P[0, x_] := 1;
P[1, x_] := 2 + 4*x;
P[n_, x_] := P[n, x] = Expand[Together[(-(n^2 - 2*n)*P[n - 2, x] + (6*n^2 - 9*n + 3 + (8*n^2 - 12*n + 4)*x)*P[n - 1, x])/(n^2 - 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] = 2 + 4*x; for(n = 2, N, my(i = n + 1); v[i] = (-(n^2 - 2*n)*v[i - 2] + (6*n^2 - 9*n + 3 + (8*n^2 - 12*n + 4)*x)*v[i - 1])/(n^2 - 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

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.