A202241 → basis A013609

nonnegative coefficients

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

Recurrence

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

Rows ?

nx0x1x2x3x4x5x6x7Pn(1)
011
1325
2510419
393028875
418781167216300
536192388376176321200
672456116015281104416644800
71441056323253765264304096012819200
Technical details
Node id
n-6aa546735711342f · revision 0 · JSON
Definition source
derived:basis_map_A013609
Fingerprint
f6-91198b4059708939

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:   3,    2;
  2:   5,   10,     4;
  3:   9,   30,    28,     8;
  4:  18,   78,   116,    72,    16;
  5:  36,  192,   388,   376,   176,    32;
  6:  72,  456,  1160,  1528,  1104,   416,    64;
  7: 144, 1056,  3232,  5376,  5264,  3040,   960,   128;
  8: 288, 2400,  8576, 17216, 21280, 16608,  8000,  2176,  256;
  9: 576, 5376, 21952, 51584, 76992, 75776, 49216, 20352, 4864, 512;
%F Formula
The row polynomials satisfy (n-3)*P(n,x) = (2*n-6+(2*n-6)*x)*P(n-1,x) for n >= 4, with P(0,x) = 1, P(1,x) = 3 + 2*x, P(2,x) = 5 + 10*x + 4*x^2, P(3,x) = 9 + 30*x + 28*x^2 + 8*x^3.
%t Mathematica
P[0, x_] := 1;
P[1, x_] := 3 + 2*x;
P[2, x_] := 5 + 10*x + 4*x^2;
P[3, x_] := 9 + 30*x + 28*x^2 + 8*x^3;
P[n_, x_] := P[n, x] = Expand[Together[((2*n - 6 + (2*n - 6)*x)*P[n - 1, x])/(n - 3)]];
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] = 3 + 2*x; v[3] = 5 + 10*x + 4*x^2; v[4] = 9 + 30*x + 28*x^2 + 8*x^3; for(n = 4, N, my(i = n + 1); v[i] = ((2*n - 6 + (2*n - 6)*x)*v[i - 1])/(n - 3)); 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

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