A086645 → D → D

nonnegative coefficients

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

Recurrence

\(\left(-42 + 47\,n - 17\,n^{2} + 2\,n^{3}\right)\,P_{n}(x) = \left(-6 - 54\,x + 13\,n + 91\,n x - 9\,n^{2} - 43\,n^{2} x + 2\,n^{3} + 6\,n^{3} x\right)\,P_{n-1}(x) + \left(10\,x - 10\,x^{2} - 14\,n x + 14\,n x^{2} + 4\,n^{2} x - 4\,n^{2} x^{2}\right)\,P_{n-1}'(x)\)
\(P_{1}(x) = 0\)
\(P_{2}(x) = 0\)
\(P_{3}(x) = 2\)

Rows ?

nx0x1x2x3x4x5Pn(1)
10
20
322
430636
514016812320
64201260540202240
79905544594013203013824
8200218018360362002027304278848
Technical details
Node id
n-7b9f4ab1f3bacb5a · revision 0 · JSON
Definition source
derived:derivative
Fingerprint
f6-51bdbfd2b01ce830

Observed on the stored rows ?

  • Degrees: -1, -1, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12 (affine: slope 1, intercept -3)
  • 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 = 1, …, ascending powers of x
%e Example
Triangle begins:
   1:    0;
   2:    0;
   3:    2;
   4:   30,      6;
   5:  140,    168,     12;
   6:  420,   1260,    540,     20;
   7:  990,   5544,   5940,   1320,     30;
   8: 2002,  18018,  36036,  20020,   2730,     42;
   9: 3640,  48048, 154440, 160160,  54600,   5040,   56;
  10: 6120, 111384, 525096, 875160, 556920, 128520, 8568, 72;
%F Formula
The row polynomials satisfy (2*n^3-17*n^2+47*n-42)*P(n,x) = (2*n^3-9*n^2+13*n-6+(6*n^3-43*n^2+91*n-54)*x)*P(n-1,x) + ((4*n^2-14*n+10)*x-(4*n^2-14*n+10)*x^2)*d/dx P(n-1,x) for n >= 4, with P(1,x) = 0, P(2,x) = 0, P(3,x) = 2.
%t Mathematica
P[1, x_] := 0;
P[2, x_] := 0;
P[3, x_] := 2;
P[n_, x_] := P[n, x] = Expand[Together[((2*n^3 - 9*n^2 + 13*n - 6 + (6*n^3 - 43*n^2 + 91*n - 54)*x)*P[n - 1, x] + ((4*n^2 - 14*n + 10)*x - (4*n^2 - 14*n + 10)*x^2)*D[P[n - 1, x], x])/(2*n^3 - 17*n^2 + 47*n - 42)]];
Table[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten
%o PARI/GP
P(N) = {my(v = vector(N)); v[1] = 0; v[2] = 0; v[3] = 2; for(n = 4, N, my(i = n); v[i] = ((2*n^3 - 9*n^2 + 13*n - 6 + (6*n^3 - 43*n^2 + 91*n - 54)*x)*v[i - 1] + ((4*n^2 - 14*n + 10)*x - (4*n^2 - 14*n + 10)*x^2)*deriv(v[i - 1], x))/(2*n^3 - 17*n^2 + 47*n - 42)); v};
row(n, p) = {my(c = Vecrev(p)); c};
T(N) = {my(v = P(N)); concat(vector(#v, i, row(i, v[i])))};
T(10)

polytool c48629374597

Properties

Proof chains ? JSON

Same fingerprint ?

References

  1. [Fav35] Jean Favard. Sur les polynômes de tchebicheff. C. R. Acad. Sci. Paris, 200:2052–2053, 1935.
  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.
  4. [Sze39] G. Szegő. Orthogonal Polynomials. Colloquium publications, American Mathematical Society, 1939. doi:10.1090/coll/023