A249248 → reverse → D+1

nonnegative coefficients

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

Recurrence

\(\left(1 + n\right)\,P_{n}(x) = \left(2\,n x^{2} - n^{2} x^{2} - n^{3} x^{2}\right)\,P_{n-4}(x) + \left(-4\,n x - 3\,n x^{2} - 2\,n^{2} x - 2\,n^{2} x^{2}\right)\,P_{n-3}(x) + \left(-2 - 2\,x - x^{2} - n + 2\,n x - n x^{2} + 2\,n^{2} x\right)\,P_{n-2}(x) + \left(3 + 2\,x + 2\,n + 2\,n x\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 1\)
\(P_{1}(x) = 4 + x\)
\(P_{2}(x) = 10 + 9\,x + x^{2}\)
\(P_{3}(x) = 25 + 46\,x + 15\,x^{2} + x^{3}\)

Rows ?

nx0x1x2x3x4x5x6x7x8x9x10x11x12x13x14Pn(1)
011
1415
2109120
3254615187
443178123221367
5645437182593011615
6881249323121234753917206
711524221133413253518079549133149
81454206313906500642795110901246601155939
9178676373398253452278786116913215881858721753009
102141027315207380315414566809744752823033907826648513721000
1125314934288061216543361800456561252292519561985166783370099118825607
12295209625092895161198217554003610773024621261780477012619081089105005114197356843
133402859185245011179681657328901643389201705882028017480518955422241534017083066211301514444223
1438838073136462322445677175786401630524416981848616682167861233096829426314924391508259273859314712774563898
Technical details
Node id
n-90ac3c48be2651b6 · revision 0 · JSON
Definition source
derived:one_plus_derivative
Fingerprint
f6-0868ac38657719af

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:   4,    1;
  2:  10,    9,     1;
  3:  25,   46,    15,      1;
  4:  43,  178,   123,     22,      1;
  5:  64,  543,   718,    259,     30,      1;
  6:  88, 1249,  3231,   2123,    475,     39,     1;
  7: 115, 2422, 11334,  13253,   5180,    795,    49,    1;
  8: 145, 4206, 31390,  65006,  42795,  11090,  1246,   60,  1;
  9: 178, 6763, 73398, 253452, 278786, 116913, 21588, 1858, 72, 1;
%F Formula
The row polynomials satisfy (n+1)*P(n,x) = -(n^3+n^2-2*n)*x^2*P(n-4,x) - ((2*n^2+4*n)*x+(2*n^2+3*n)*x^2)*P(n-3,x) - (n+2-(2*n^2+2*n-2)*x+(n+1)*x^2)*P(n-2,x) + (2*n+3+(2*n+2)*x)*P(n-1,x) for n >= 4, with P(0,x) = 1, P(1,x) = 4 + x, P(2,x) = 10 + 9*x + x^2, P(3,x) = 25 + 46*x + 15*x^2 + x^3.
%t Mathematica
P[0, x_] := 1;
P[1, x_] := 4 + x;
P[2, x_] := 10 + 9*x + x^2;
P[3, x_] := 25 + 46*x + 15*x^2 + x^3;
P[n_, x_] := P[n, x] = Expand[Together[(-(n^3 + n^2 - 2*n)*x^2*P[n - 4, x] - ((2*n^2 + 4*n)*x + (2*n^2 + 3*n)*x^2)*P[n - 3, x] - (n + 2 - (2*n^2 + 2*n - 2)*x + (n + 1)*x^2)*P[n - 2, x] + (2*n + 3 + (2*n + 2)*x)*P[n - 1, x])/(n + 1)]];
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] = 4 + x; v[3] = 10 + 9*x + x^2; v[4] = 25 + 46*x + 15*x^2 + x^3; for(n = 4, N, my(i = n + 1); v[i] = (-(n^3 + n^2 - 2*n)*x^2*v[i - 4] - ((2*n^2 + 4*n)*x + (2*n^2 + 3*n)*x^2)*v[i - 3] - (n + 2 - (2*n^2 + 2*n - 2)*x + (n + 1)*x^2)*v[i - 2] + (2*n + 3 + (2*n + 2)*x)*v[i - 1])/(n + 1)); 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. [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
  2. [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.