A075498 → θ+1

nonnegative coefficients

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

Recurrence

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

Rows ?

nx0x1x2x3x4x5x6x7Pn(1)
011
1325
2918330
327126544211
48181067512051691
5243502272902340225615126
672930618731433780063003787148975
721871851667042145511241417501436458881599401
Technical details
Node id
n-dbe966e134187411 · revision 0 · JSON
Definition source
derived:theta_plus_one
Fingerprint
f6-75160c234424b9b0

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

Matches ?

No OEIS matches.

Submission text ?

Atlas rows n = 0, …, ascending powers of x
%e Example
Triangle begins:
  0:     1;
  1:     3,       2;
  2:     9,      18,        3;
  3:    27,     126,       54,        4;
  4:    81,     810,      675,      120,        5;
  5:   243,    5022,     7290,     2340,      225,        6;
  6:   729,   30618,    73143,    37800,     6300,      378,       7;
  7:  2187,  185166,   704214,   551124,   141750,    14364,     588,     8;
  8:  6561, 1115370,  6615675,  7552440,  2815155,   428652,   29106,   864,    9;
  9: 19683, 6705342, 61214130, 99450180, 51667875, 11093922, 1111320, 54000, 1215, 10;
%F Formula
The row polynomials satisfy P(n,x) = -x^2*P(n-2,x) - 3*x^2*d/dx P(n-2,x) + (3+2*x)*P(n-1,x) + 3*x*d/dx P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 3 + 2*x.
%t Mathematica
P[0, x_] := 1;
P[1, x_] := 3 + 2*x;
P[n_, x_] := P[n, x] = Expand[-x^2*P[n - 2, x] - 3*x^2*D[P[n - 2, x], x] + (3 + 2*x)*P[n - 1, x] + 3*x*D[P[n - 1, x], x]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten
%o PARI/GP
P(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = 3 + 2*x; for(n = 2, N, my(i = n + 1); v[i] = -x^2*v[i - 2] - 3*x^2*deriv(v[i - 2], x) + (3 + 2*x)*v[i - 1] + 3*x*deriv(v[i - 1], 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

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.