A136572 → (θ+1)² → D+1

nonnegative coefficientsonly rational roots

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

Recurrence

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

Rows ?

nx0x1x2x3x4x5x6x7x8x9x10x11x12x13x14Pn(1)
011
1448
20361854
30028896384
400024006003000
5000021600432025920
60000021168035280246960
700000022579203225602580480
8000000026127360326592029393280
90000000032659200036288000362880000
1000000000043908480004390848004829932800
11000000000063228211200574801920068976230400
1200000000000971415244800809512704001052366515200
1300000000000015866448998400122049607680017086945075200
14000000000000027461161728000019615115520000294226732800000
Technical details
Node id
n-02c485e5596a5d6b · revision 0 · JSON
Definition source
derived:one_plus_derivative
Fingerprint
f6-2327141074f67bdf

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,  4;
  2: 0, 36,  18;
  3: 0,  0, 288,   96;
  4: 0,  0,   0, 2400,   600;
  5: 0,  0,   0,    0, 21600,   4320;
  6: 0,  0,   0,    0,     0, 211680,   35280;
  7: 0,  0,   0,    0,     0,      0, 2257920,   322560;
  8: 0,  0,   0,    0,     0,      0,       0, 26127360,   3265920;
  9: 0,  0,   0,    0,     0,      0,       0,        0, 326592000, 36288000;
%F Formula
The row polynomials satisfy (n^2-n+n*x)*P(n,x) = ((n^3+2*n^2+n)*x+(n^2+2*n+1)*x^2)*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[Together[(((n^3 + 2*n^2 + n)*x + (n^2 + 2*n + 1)*x^2)*P[n - 1, x])/(n^2 - n + n*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^3 + 2*n^2 + n)*x + (n^2 + 2*n + 1)*x^2)*v[i - 1])/(n^2 - n + n*x)); 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. [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.