A290598 → θ+1

nonnegative coefficients

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

Recurrence

\(\left(-2 - x + n x\right)\,P_{n}(x) = \left(4 - 2\,x - 6\,n - 5\,n x + n x^{2} + 3\,n^{2} x\right)\,P_{n-1}(x) + \left(-6\,x + 3\,n x^{2}\right)\,P_{n-1}'(x)\)
\(P_{1}(x) = 1\)

Rows ?

nx0x1x2x3x4x5x6x7Pn(1)
111
2426
32828359
4280420904794
5364072802340208513473
6582401456006240083204006274966
71106560331968017784003161602280068476544291
82434432085205120547747201217216011704005266810788177720474
Technical details
Node id
n-ed7f37079a43bdf8 · revision 0 · JSON
Definition source
derived:theta_plus_one
Fingerprint
f6-9c7ee164876013bf

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 -1)
  • 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 ℚ): no

Matches ?

No OEIS matches.

Submission text ?

Atlas rows n = 1, …, ascending powers of x
%e Example
Triangle begins:
   1:           1;
   2:           4,           2;
   3:          28,          28,           3;
   4:         280,         420,          90,           4;
   5:        3640,        7280,        2340,         208,          5;
   6:       58240,      145600,       62400,        8320,        400,         6;
   7:     1106560,     3319680,     1778400,      316160,      22800,       684,       7;
   8:    24344320,    85205120,    54774720,    12172160,    1170400,     52668,    1078,      8;
   9:   608608000,  2434432000,  1825824000,   486886400,   58520000,   3511200,  107800,   1600,    9;
  10: 17041024000, 76684608000, 65729664000, 20449228800, 2949408000, 221205600, 9055200, 201600, 2268, 10;
%F Formula
The row polynomials satisfy -(2-(n-1)*x)*P(n,x) = -(6*n-4-(3*n^2-5*n-2)*x-n*x^2)*P(n-1,x) - (6*x-3*n*x^2)*d/dx P(n-1,x) for n >= 2, with P(1,x) = 1.
%t Mathematica
P[1, x_] := 1;
P[n_, x_] := P[n, x] = Expand[Together[(-(6*n - 4 - (3*n^2 - 5*n - 2)*x - n*x^2)*P[n - 1, x] - (6*x - 3*n*x^2)*D[P[n - 1, x], x])/(-2 + (n - 1)*x)]];
Table[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten
%o PARI/GP
P(N) = {my(v = vector(N)); v[1] = 1; for(n = 2, N, my(i = n); v[i] = (-(6*n - 4 - (3*n^2 - 5*n - 2)*x - n*x^2)*v[i - 1] - (6*x - 3*n*x^2)*deriv(v[i - 1], x))/(-2 + (n - 1)*x)); v};
row(n, p) = {my(c = Vecrev(p)); c};
T(N) = {my(v = P(N)); concat(vector(#v, i, row(i, v[i])))};
T(10)

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.