A008955 → basis A013609 → reverse

nonnegative coefficientsonly rational roots

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

Recurrence

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

Rows ?

nx0x1x2x3x4x5x6x7Pn(1)
011
1224
216261052
32886284401001456
49216249922475610680170071344
5460800148921618875921177656362680442005422144
63317760012427315219100761615463213669686232166015601635400591013696
732514048001383764889624932403968247043301281456085753651112644809903472008177000087470027008
Technical details
Node id
n-e9f9c578a5078389 · revision 0 · JSON
Definition source
derived:reversal
Fingerprint
f6-1258bebed215369f

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:              2,               2;
  2:             16,              26,              10;
  3:            288,             628,             440,              100;
  4:           9216,           24992,           24756,            10680,            1700;
  5:         460800,         1489216,         1887592,          1177656,          362680,           44200;
  6:       33177600,       124273152,       191007616,        154632136,        69686232,        16601560,         1635400;
  7:     3251404800,     13837648896,     24932403968,      24704330128,     14560857536,      5111264480,       990347200,       81770000;
  8:   416179814400,   1982560370688,   4090794886144,    4782760514304,   3469571222928,   1600697593280,    458996632800,    74839128000,    5315050000;
  9: 67421129932800, 355301524832256, 825278721951744, 1110252383981056, 954256900287264, 543817850391456, 205614657162560, 49761662625600, 6997846596000, 435834100000;
%F Formula
The row polynomials satisfy P(n,x) = (2*n^2+(n^2+1)*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[(2*n^2 + (n^2 + 1)*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] = (2*n^2 + (n^2 + 1)*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.