A082985 → reverse → x ↦ x+1

nonnegative coefficients

Proved for all n all roots real, in (−5, −1)coefficients of one signHadamard kernelinterlacing (weak)

Recurrence

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

Rows ?

nx0x1x2x3x4x5x6x7x8x9x10x11x12x13x14Pn(1)
011
1415
2117119
3293110171
47611560131265
519939028598161989
6521125411855661451913691
7136438934524278598520122113775
835711178916280123135595156926625151409
9934935045561055043428113101012345340281191861
102447610269518708019509412917856847168703340423311716035
11640792975166078307219285545152896181051122655045815153412672279
1216776185393219339262578520225629513665225880841814223987060956163719973081
13439204243204160478808947558879289060662433025662110580029645157640790972640137220045
14114985168813951864175530312034330699332562509714555145616164019552834632768075110050845431138907099
Technical details
Node id
n-02870b15db72fb9a · revision 0 · JSON
Definition source
derived:shift_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 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:   11,     7,     1;
  3:   29,    31,    10,     1;
  4:   76,   115,    60,    13,     1;
  5:  199,   390,   285,    98,    16,     1;
  6:  521,  1254,  1185,   566,   145,    19,    1;
  7: 1364,  3893,  4524,  2785,   985,   201,   22,   1;
  8: 3571, 11789, 16280, 12313,  5595,  1569,  266,  25,  1;
  9: 9349, 35045, 56105, 50434, 28113, 10101, 2345, 340, 28, 1;
%F Formula
The row polynomials satisfy (2*n-1)*P(n,x) = (3*n+1+n*x)*P(n-1,x) + (5+6*x+x^2)*d/dx P(n-1,x) for n >= 1, with P(0,x) = 1.
%t Mathematica
P[0, x_] := 1;
P[n_, x_] := P[n, x] = Expand[Together[((3*n + 1 + n*x)*P[n - 1, x] + (5 + 6*x + x^2)*D[P[n - 1, x], x])/(2*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; for(n = 1, N, my(i = n + 1); v[i] = ((3*n + 1 + n*x)*v[i - 1] + (5 + 6*x + x^2)*deriv(v[i - 1], x))/(2*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

Same fingerprint ?

References

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