A008299 → θ+1

nonnegative coefficients

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

Recurrence

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

Rows ?

nx0x1x2x3x4x5x6x7Pn(1)
011
111
2167
312021
41504596
51112315428
6123814704202129
714925754504011287
8110022047537800472564003
9120246880522792086625385375
10140702229481211980952875623702454244
111816470527659488008183175162162016467036
121163542195193276596326061055024594570945945116022245
13132736675702312380368040715675028504476033108075855903025
141655022063903453911858025544018502801258460662161500162162006593861127
Technical details
Node id
n-d3f5da06060f83a9 · revision 0 · JSON
Definition source
derived:theta_plus_one
Fingerprint
f6-fa553defd75f6e82

Observed on the stored rows ?

  • Degrees: 0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7 (half 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: 1;
  2: 1,    6;
  3: 1,   20;
  4: 1,   50,    45;
  5: 1,  112,   315;
  6: 1,  238,  1470,    420;
  7: 1,  492,  5754,   5040;
  8: 1, 1002, 20475,  37800,  4725;
  9: 1, 2024, 68805, 227920, 86625;
%F Formula
The row polynomials satisfy P(n,x) = -(n^2-1)*x^2*P(n-4,x) - (n+1)*x^2*d/dx P(n-3,x) + (2*n+2)*x*P(n-2,x) + P(n-1,x) + x*d/dx P(n-1,x) for n >= 4, with P(0,x) = 1, P(1,x) = 1, P(2,x) = 1 + 6*x, P(3,x) = 1 + 20*x.
%t Mathematica
P[0, x_] := 1;
P[1, x_] := 1;
P[2, x_] := 1 + 6*x;
P[3, x_] := 1 + 20*x;
P[n_, x_] := P[n, x] = Expand[-(n^2 - 1)*x^2*P[n - 4, x] - (n + 1)*x^2*D[P[n - 3, x], x] + (2*n + 2)*x*P[n - 2, x] + P[n - 1, x] + 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] = 1; v[3] = 1 + 6*x; v[4] = 1 + 20*x; for(n = 4, N, my(i = n + 1); v[i] = -(n^2 - 1)*x^2*v[i - 4] - (n + 1)*x^2*deriv(v[i - 3], x) + (2*n + 2)*x*v[i - 2] + v[i - 1] + 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. [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
  2. [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
  3. [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.