A008306 → θ+1

nonnegative coefficients

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

Recurrence

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

Rows ?

nx0x1x2x3x4x5x6x7Pn(1)
011
122
26612
3244064
412026045425
572018486303198
6504014616714042027216
7403201284487929610080258144
8362880124675291098017640047252701737
936288001327392011036520282128017325030933770
103991680015399648014197312844395120433125062370384675148
11479001600193504896019426080967093257609429420032432405163521856
126227020800261934732802825683660811682102432194724530010972962094594574417353985
1387178291200380120670720436231740672199811451840396746350003120357240662161501146203362822
1413076743680005888620684800713282925888035623085097608141589456008185577400029135106001621620018790377267840
Technical details
Node id
n-fe674caaab8df0fd · revision 0 · JSON
Definition source
derived:theta_plus_one
Fingerprint
f6-acb523b53b6d3c90

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:       2;
  2:       6,        6;
  3:      24,       40;
  4:     120,      260,       45;
  5:     720,     1848,      630;
  6:    5040,    14616,     7140,     420;
  7:   40320,   128448,    79296,   10080;
  8:  362880,  1246752,   910980,  176400,   4725;
  9: 3628800, 13273920, 11036520, 2821280, 173250;
%F Formula
The row polynomials satisfy n*P(n,x) = -(n^3-n)*x^2*P(n-4,x) - (2*n^3-2*n)*x*P(n-3,x) - (n^3-n-(2*n^2+2*n)*x)*P(n-2,x) + (2*n^2+n-1)*P(n-1,x) for n >= 4, with P(0,x) = 1, P(1,x) = 2, P(2,x) = 6 + 6*x, P(3,x) = 24 + 40*x.
%t Mathematica
P[0, x_] := 1;
P[1, x_] := 2;
P[2, x_] := 6 + 6*x;
P[3, x_] := 24 + 40*x;
P[n_, x_] := P[n, x] = Expand[Together[(-(n^3 - n)*x^2*P[n - 4, x] - (2*n^3 - 2*n)*x*P[n - 3, x] - (n^3 - n - (2*n^2 + 2*n)*x)*P[n - 2, x] + (2*n^2 + n - 1)*P[n - 1, x])/(n)]];
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; v[3] = 6 + 6*x; v[4] = 24 + 40*x; for(n = 4, N, my(i = n + 1); v[i] = (-(n^3 - n)*x^2*v[i - 4] - (2*n^3 - 2*n)*x*v[i - 3] - (n^3 - n - (2*n^2 + 2*n)*x)*v[i - 2] + (2*n^2 + n - 1)*v[i - 1])/(n)); 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.