A053117 → x ↦ x+1 → reverse

nonnegative coefficients

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

Recurrence

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

Rows ?

nx0x1x2x3x4x5x6x7x8x9x10x11x12x13x14Pn(1)
111
2224
348315
482420456
5166484405209
632160288224706780
76438488096050411272911
81288962496352026401008168810864
925620486720116481144063361848240940545
1051246081740835840436803203213728316833010151316
11102410240437761044481523201397768008027456514844011564719
12204822528107520291840496128548352396032183040514808008572122107560
1340964915225907278848015321601984512173644810183683889609152012012728137865521
148192106496614400207257645337606741504694579249612802418624777920155584174729101429354524
15163842293761437696532480012953600217620482584243221829632130233605374720147804825459224752112015109552575
Technical details
Node id
n-fbf0c4d004490261 · revision 0 · JSON
Definition source
derived:reversal
Fingerprint
f6-d6d34c33242db792

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:   2,    2;
   3:   4,    8,     3;
   4:   8,   24,    20,     4;
   5:  16,   64,    84,    40,     5;
   6:  32,  160,   288,   224,    70,     6;
   7:  64,  384,   880,   960,   504,   112,     7;
   8: 128,  896,  2496,  3520,  2640,  1008,   168,    8;
   9: 256, 2048,  6720, 11648, 11440,  6336,  1848,  240,   9;
  10: 512, 4608, 17408, 35840, 43680, 32032, 13728, 3168, 330, 10;
%F Formula
The row polynomials satisfy (n-1)*P(n,x) = (2*n-2+(3*n-4)*x)*P(n-1,x) - (x+2*x^2)*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 - 2 + (3*n - 4)*x)*P[n - 1, x] - (x + 2*x^2)*D[P[n - 1, x], x])/(n - 1)]];
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 - 2 + (3*n - 4)*x)*v[i - 1] - (x + 2*x^2)*deriv(v[i - 1], x))/(n - 1)); 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. [Sze39] G. Szegő. Orthogonal Polynomials. Colloquium publications, American Mathematical Society, 1939. doi:10.1090/coll/023