A088996 → basis A013610 → basis A007318

nonnegative coefficientsonly rational roots

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

Recurrence

\(P_{n}(x) = \left(-1 + 5\,n + 3\,n x\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 1\)

Rows ?

nx0x1x2x3x4x5x6x7Pn(1)
011
1437
2365118105
350410387111622415
49576257702596511610194474865
52298247621201009710668115220806291602919735
66664896262383124299975037550115184294444820148524880137227545
72266064641032065424201299605221796986601415153511550903356119069028110224807547514975
Technical details
Node id
n-fe9a040afa3cc625 · revision 0 · JSON
Definition source
derived:shift_x_plus_one
Fingerprint
f6-d5423eb916062c66

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:            4,             3;
  2:           36,            51,            18;
  3:          504,          1038,           711,           162;
  4:         9576,         25770,         25965,         11610,          1944;
  5:       229824,        762120,       1009710,        668115,        220806,         29160;
  6:      6664896,      26238312,      42999750,      37550115,      18429444,       4820148,        524880;
  7:    226606464,    1032065424,    2012996052,    2179698660,    1415153511,     550903356,     119069028,     11022480;
  8:   8837652096,   45689106672,  103276416204,  133320152988,  107503754769,   55448915148,   17865372636,   3287533392,    264539520;
  9: 388856692224, 2248937300160, 5777768193120, 8654549968980, 8329809340512, 5342353645275, 2283197104980, 627016530420, 100403140464, 7142567040;
%F Formula
The row polynomials satisfy P(n,x) = (5*n-1+3*n*x)*P(n-1,x) for n >= 1, with P(0,x) = 1.
%t Mathematica
P[0, x_] := 1;
P[n_, x_] := P[n, x] = Expand[(5*n - 1 + 3*n*x)*P[n - 1, x]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten
%o PARI/GP
P(N) = {my(v = vector(N + 1)); v[1] = 1; for(n = 1, N, my(i = n + 1); v[i] = (5*n - 1 + 3*n*x)*v[i - 1]); 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.