A085880 → D → basis A013611

nonnegative coefficientsonly rational roots

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

Recurrence

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

Rows ?

nx0x1x2x3x4x5x6Pn(1)
10
211
381624
460240240540
544826885376358412096
63360268808064010752053760272160
7253442534401013760202752020275208110086158592
819219223063041153152030750720461260803690086412300288140107968
Technical details
Node id
n-20043c35aa371b14 · revision 0 · JSON
Definition source
derived:basis_map_A013611
Fingerprint
f6-11aec07ce60b6d61

Observed on the stored rows ?

  • Degrees: -1, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13 (affine: slope 1, intercept -2)
  • 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 ℚ): yes

Matches ?

No OEIS matches.

Submission text ?

Atlas rows n = 1, …, ascending powers of x
%e Example
Triangle begins:
   1:        0;
   2:        1;
   3:        8,        16;
   4:       60,       240,        240;
   5:      448,      2688,       5376,       3584;
   6:     3360,     26880,      80640,     107520,       53760;
   7:    25344,    253440,    1013760,    2027520,     2027520,      811008;
   8:   192192,   2306304,   11531520,   30750720,    46126080,    36900864,    12300288;
   9:  1464320,  20500480,  123002880,  410009600,   820019200,   984023040,   656015360,   187432960;
  10: 11202048, 179232768, 1254629376, 5018517504, 12546293760, 20074070016, 20074070016, 11470897152, 2867724288;
%F Formula
The row polynomials satisfy (n^2-2*n)*P(n,x) = (8*n^2-20*n+12+(16*n^2-40*n+24)*x)*P(n-1,x) for n >= 3, with P(1,x) = 0, P(2,x) = 1.
%t Mathematica
P[1, x_] := 0;
P[2, x_] := 1;
P[n_, x_] := P[n, x] = Expand[Together[((8*n^2 - 20*n + 12 + (16*n^2 - 40*n + 24)*x)*P[n - 1, x])/(n^2 - 2*n)]];
Table[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten
%o PARI/GP
P(N) = {my(v = vector(N)); v[1] = 0; v[2] = 1; for(n = 3, N, my(i = n); v[i] = ((8*n^2 - 20*n + 12 + (16*n^2 - 40*n + 24)*x)*v[i - 1])/(n^2 - 2*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. [Bra06] Petter Brändén. On linear transformations preserving the Pólya frequency property. Transactions of the American Mathematical Society, 358(8):3697–3716, February 2006. doi:10.1090/s0002-9947-06-03856-6
  2. [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
  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.