Real-rooted atlas

A111125 → reverse → x ↦ x/(x+1)

nonnegative coefficients

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

Recurrence

\(\left(-3 - 6\,x - 3\,x^{2} + 2\,n + 4\,n x + 2\,n x^{2}\right)\,P_{n}(x) = \left(-3 - 20\,x - 41\,x^{2} - 34\,x^{3} - 10\,x^{4} + 2\,n + 13\,n x + 25\,n x^{2} + 19\,n x^{3} + 5\,n x^{4}\right)\,P_{n-1}(x) + \left(-x - 8\,x^{2} - 18\,x^{3} - 16\,x^{4} - 5\,x^{5}\right)\,P_{n-1}'(x)\)
\(P_{1}(x) = 1\)

Rows ?

nx0x1x2x3x4x5x6x7Pn(1)
111
2145
3171119
4110312971
51136011576265
611698285390199989
7119145566118512545213691
8122201985278545243893136413775

All 15 rows

Technical details
Node id
n-5a5e6cfc99d7de0b · revision 0 · JSON
Definition source
derived:mobius_x_over_x_plus_one
Fingerprint
f6-2c11568138d58d94

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 -1)
  • 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: 1;
   2: 1,  4;
   3: 1,  7,  11;
   4: 1, 10,  31,   29;
   5: 1, 13,  60,  115,    76;
   6: 1, 16,  98,  285,   390,   199;
   7: 1, 19, 145,  566,  1185,  1254,   521;
   8: 1, 22, 201,  985,  2785,  4524,  3893,  1364;
   9: 1, 25, 266, 1569,  5595, 12313, 16280, 11789,  3571;
  10: 1, 28, 340, 2345, 10101, 28113, 50434, 56105, 35045, 9349;
%F Formula
The row polynomials satisfy (2*n-3+(4*n-6)*x+(2*n-3)*x^2)*P(n,x) = (2*n-3+(13*n-20)*x+(25*n-41)*x^2+(19*n-34)*x^3+(5*n-10)*x^4)*P(n-1,x) - (x+8*x^2+18*x^3+16*x^4+5*x^5)*d/dx P(n-1,x) for n >= 2, with P(1,x) = 1.
%t Mathematica
P[1, x_] := 1;
P[n_, x_] := P[n, x] = Expand[Together[((2*n - 3 + (13*n - 20)*x + (25*n - 41)*x^2 + (19*n - 34)*x^3 + (5*n - 10)*x^4)*P[n - 1, x] - (x + 8*x^2 + 18*x^3 + 16*x^4 + 5*x^5)*D[P[n - 1, x], x])/(2*n - 3 + (4*n - 6)*x + (2*n - 3)*x^2)]];
Table[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten
%o PARI/GP
P(N) = {my(v = vector(N)); v[1] = 1; for(n = 2, N, my(i = n); v[i] = ((2*n - 3 + (13*n - 20)*x + (25*n - 41)*x^2 + (19*n - 34)*x^3 + (5*n - 10)*x^4)*v[i - 1] - (x + 8*x^2 + 18*x^3 + 16*x^4 + 5*x^5)*deriv(v[i - 1], x))/(2*n - 3 + (4*n - 6)*x + (2*n - 3)*x^2)); 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

Candidate equalities ?

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. [Sze39] G. Szegő. Orthogonal Polynomials. Colloquium publications, American Mathematical Society, 1939. doi:10.1090/coll/023