A128540 → basis A013611

nonnegative coefficientsonly rational roots

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

Recurrence

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

Rows ?

nx0x1x2x3x4x5x6x7Pn(1)
011
1246
24243260
3660192192450
410140720160012803750
5162882048716812288819230000
626572520024960665609318453248243750
742109212096739202688005806086881283440641968750
Technical details
Node id
n-694927053130d044 · revision 0 · JSON
Definition source
derived:basis_map_A013611
Fingerprint
f6-13cd5a379fa767ee

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 ℚ): yes

Matches ?

No OEIS matches.

Submission text ?

Atlas rows n = 0, …, ascending powers of x
%e Example
Triangle begins:
  0:   1;
  1:   2,    4;
  2:   4,   24,    32;
  3:   6,   60,   192,    192;
  4:  10,  140,   720,   1600,    1280;
  5:  16,  288,  2048,   7168,   12288,     8192;
  6:  26,  572,  5200,  24960,   66560,    93184,    53248;
  7:  42, 1092, 12096,  73920,  268800,   580608,   688128,   344064;
  8:  68, 2040, 26656, 198016,  913920,  2680832,  4874240,  5013504,  2228224;
  9: 110, 3740, 56320, 492800, 2759680, 10250240, 25231360, 39649280, 36044800, 14417920;
%F Formula
The row polynomials satisfy (n-2)*P(n,x) = (n-2+(8*n-16)*x+(16*n-32)*x^2)*P(n-2,x) + (n-2+(4*n-8)*x)*P(n-1,x) for n >= 3, with P(0,x) = 1, P(1,x) = 2 + 4*x, P(2,x) = 4 + 24*x + 32*x^2.
%t Mathematica
P[0, x_] := 1;
P[1, x_] := 2 + 4*x;
P[2, x_] := 4 + 24*x + 32*x^2;
P[n_, x_] := P[n, x] = Expand[Together[((n - 2 + (8*n - 16)*x + (16*n - 32)*x^2)*P[n - 2, x] + (n - 2 + (4*n - 8)*x)*P[n - 1, x])/(n - 2)]];
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; v[3] = 4 + 24*x + 32*x^2; for(n = 3, N, my(i = n + 1); v[i] = ((n - 2 + (8*n - 16)*x + (16*n - 32)*x^2)*v[i - 2] + (n - 2 + (4*n - 8)*x)*v[i - 1])/(n - 2)); 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. [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.