A137320 → basis A013611 → 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(9 + 8\,x + n\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 1\)

Rows ?

nx0x1x2x3x4x5x6x7Pn(1)
011
110818
211016864342
31320289621125126840
4171604820850624235524096143640
52402408121921094400734720245760327683160080
636036001410480022913536197760009564160245760026214472681840
7576576002545056004794549764997242883112345601158348802385510420971521744364160
Technical details
Node id
n-e0df8ce9d576df35 · revision 0 · JSON
Definition source
derived:shift_x_plus_one
Fingerprint
f6-38173b80df527fb6

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,           8;
  2:         110,         168,           64;
  3:        1320,        2896,         2112,          512;
  4:       17160,       48208,        50624,        23552,         4096;
  5:      240240,      812192,      1094400,       734720,       245760,        32768;
  6:     3603600,    14104800,     22913536,     19776000,      9564160,      2457600,      262144;
  7:    57657600,   254505600,    479454976,    499724288,    311234560,    115834880,    23855104,     2097152;
  8:   980179200,  4787856000,  10186779392,  12330952704,   9288781824,   4459069440,  1332215808,   226492416,   16777216;
  9: 17643225600, 94022841600, 221664877056, 303451383808, 265845694464, 154573504512, 59652440064, 14734589952, 2113929216, 134217728;
%F Formula
The row polynomials satisfy P(n,x) = (n+9+8*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[(n + 9 + 8*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] = (n + 9 + 8*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.