A225476 → D+1

nonnegative coefficients

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

Recurrence

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

Rows ?

nx0x1x2x3x4x5x6x7x8x9x10x11x12x13x14Pn(1)
011
1213
258215
31449366105
44127240419224933
5122144137203420120012010023
636574483090247040310808640720126195
71094379692418365616665964003066007056050401821165
83281192032182410461528329659664782208032860806451204032029625513
998429667211343592063730680140626080164863440107533440381628806531840362880536223723
1029525485328897420202635479680190577976030727468802858315040155796480047839680072576000362880010687190775
11885742432548969888363661699249262456216400052633297200663011395205095945008023830329600644656320087816960039916800232544252625
122657211218045924977191804587705838723052602593048485821273601398349719360143868662784094038525504038479795200093006144000114960384004790016005484912970893
137971626095544013526626012055206086754036929257965601308162811956027515780772480365984124105603173507745408018023540895360655290155520014311769472001619025408006227020800139387510991823
1423914853049366328248996065502513261639072043776139319640194929877862720513904929698160862055382988800957557730729600716271370214400359367078470400117516336537600234073711872002440992153600871782912003796699051667355
Technical details
Node id
n-362d698441b465c3 · revision 0 · JSON
Definition source
derived:one_plus_derivative
Fingerprint
f6-0d549fd1b86bbcc3

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:    2,      1;
  2:    5,      8,        2;
  3:   14,     49,       36,        6;
  4:   41,    272,      404,      192,        24;
  5:  122,   1441,     3720,     3420,      1200,       120;
  6:  365,   7448,    30902,    47040,     31080,      8640,       720;
  7: 1094,  37969,   241836,   561666,    596400,    306600,     70560,     5040;
  8: 3281, 192032,  1824104,  6152832,   9659664,   7822080,   3286080,   645120,   40320;
  9: 9842, 966721, 13435920, 63730680, 140626080, 164863440, 107533440, 38162880, 6531840, 362880;
%F Formula
The row polynomials satisfy P(n,x) = -(3+2*x-x^2-x^3)*P(n-2,x) - (2*x-x^2-3*x^3-x^4)*d/dx P(n-2,x) + (4+2*x-x^2)*P(n-1,x) + (2*x+x^2)*d/dx P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 2 + x.
%t Mathematica
P[0, x_] := 1;
P[1, x_] := 2 + x;
P[n_, x_] := P[n, x] = Expand[-(3 + 2*x - x^2 - x^3)*P[n - 2, x] - (2*x - x^2 - 3*x^3 - x^4)*D[P[n - 2, x], x] + (4 + 2*x - x^2)*P[n - 1, x] + (2*x + x^2)*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] = 2 + x; for(n = 2, N, my(i = n + 1); v[i] = -(3 + 2*x - x^2 - x^3)*v[i - 2] - (2*x - x^2 - 3*x^3 - x^4)*deriv(v[i - 2], x) + (4 + 2*x - x^2)*v[i - 1] + (2*x + x^2)*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. [MW08] Shi-Mei Ma and Yi Wang. q-Eulerian polynomials and polynomials with only real zeros. The Electronic Journal of Combinatorics, 15(1):Research Paper 17, January 2008. doi:10.37236/741
  4. [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.