Hadamard-factor parent of A155495 → D

nonnegative coefficients

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

Recurrence

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

Rows ?

nx0x1x2x3x4x5x6x7x8Pn(1)
1628
21530348
328140844256
44542063018051280
5669902772198033066144
69120029009120125005546728672
71203640240245148040040109208408131072
81536120556921750322187901113842142012249589824
Technical details
Node id
n-7c4b5a90bdd6f056 · revision 0 · JSON
Definition source
derived:derivative
Fingerprint
f6-49c3a6b95fc852bf

Observed on the stored rows ?

  • Degrees: 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15 (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 = 1, …, ascending powers of x
%e Example
Triangle begins:
   1:   6,     2;
   2:  15,    30,      3;
   3:  28,   140,     84,       4;
   4:  45,   420,    630,     180,       5;
   5:  66,   990,   2772,    1980,     330,       6;
   6:  91,  2002,   9009,   12012,    5005,     546,       7;
   7: 120,  3640,  24024,   51480,   40040,   10920,     840,      8;
   8: 153,  6120,  55692,  175032,  218790,  111384,   21420,   1224,     9;
   9: 190,  9690, 116280,  503880,  923780,  755820,  271320,  38760,  1710,   10;
  10: 231, 14630, 223839, 1279080, 3233230, 3879876, 2238390, 596904, 65835, 2310, 11;
%F Formula
The row polynomials satisfy (2*n^2-n)*P(n,x) = (2*n^2+3*n+1+(6*n^2+n-5)*x)*P(n-1,x) + ((4*n+4)*x-(4*n+4)*x^2)*d/dx P(n-1,x) for n >= 2, with P(1,x) = 6 + 2*x.
%t Mathematica
P[1, x_] := 6 + 2*x;
P[n_, x_] := P[n, x] = Expand[Together[((2*n^2 + 3*n + 1 + (6*n^2 + n - 5)*x)*P[n - 1, x] + ((4*n + 4)*x - (4*n + 4)*x^2)*D[P[n - 1, x], x])/(2*n^2 - n)]];
Table[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten
%o PARI/GP
P(N) = {my(v = vector(N)); v[1] = 6 + 2*x; for(n = 2, N, my(i = n); v[i] = ((2*n^2 + 3*n + 1 + (6*n^2 + n - 5)*x)*v[i - 1] + ((4*n + 4)*x - (4*n + 4)*x^2)*deriv(v[i - 1], x))/(2*n^2 - n)); 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