A156992 → basis A013610 → x ↦ x+1

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

Rows ?

nx0x1x2x3x4x5x6x7Pn(1)
011
110616
215018054384
330005400324064812288
475000180000162000648009720491520
52250000675000081000004860000145800017496023592960
6787500002835000004252500003402000001530900003674160036741601321205760
7315000000013230000000238140000002381400000014288400000514382400010287648008817984084557168640
Technical details
Node id
n-cb1e68669081ca55 · 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:            10,              6;
  2:           150,            180,             54;
  3:          3000,           5400,           3240,             648;
  4:         75000,         180000,         162000,           64800,            9720;
  5:       2250000,        6750000,        8100000,         4860000,         1458000,         174960;
  6:      78750000,      283500000,      425250000,       340200000,       153090000,       36741600,        3674160;
  7:    3150000000,    13230000000,    23814000000,     23814000000,     14288400000,     5143824000,     1028764800,      88179840;
  8:  141750000000,   680400000000,  1428840000000,   1714608000000,   1285956000000,   617258880000,   185177664000,   31744742400,    2380855680;
  9: 7087500000000, 38272500000000, 91854000000000, 128595600000000, 115736040000000, 69441624000000, 27776649600000, 7142567040000, 1071385056000, 71425670400;
%F Formula
The row polynomials satisfy P(n,x) = (5*n+5+(3*n+3)*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 + 5 + (3*n + 3)*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 + 5 + (3*n + 3)*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.