A196347 → 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(5\,n + 3\,n x\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 1\)

Rows ?

nx0x1x2x3x4x5x6x7Pn(1)
011
1538
2506018128
375013508101623072
415000360003240012960194498304
537500011250001350000810000243000291603932160
611250000405000006075000048600000218700005248800524880188743680
739375000016537500002976750000297675000017860500006429780001285956001102248010569646080
Technical details
Node id
n-66d46e23b1cea6df · revision 0 · JSON
Definition source
derived:shift_x_plus_one
Fingerprint
f6-b1029f17d1b64336

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:            5,             3;
  2:           50,            60,            18;
  3:          750,          1350,           810,            162;
  4:        15000,         36000,         32400,          12960,           1944;
  5:       375000,       1125000,       1350000,         810000,         243000,         29160;
  6:     11250000,      40500000,      60750000,       48600000,       21870000,       5248800,        524880;
  7:    393750000,    1653750000,    2976750000,     2976750000,     1786050000,     642978000,     128595600,     11022480;
  8:  15750000000,   75600000000,  158760000000,   190512000000,   142884000000,   68584320000,   20575296000,   3527193600,    264539520;
  9: 708750000000, 3827250000000, 9185400000000, 12859560000000, 11573604000000, 6944162400000, 2777664960000, 714256704000, 107138505600, 7142567040;
%F Formula
The row polynomials satisfy P(n,x) = (5*n+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 + 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 + 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

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.