A133214 → D

nonnegative coefficients

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

Recurrence

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

Rows ?

nx0x1x2x3x4x5x6x7x8Pn(1)
08816
1187224114
23228838464768
350800240016001605010
4721800960014400576038432016
598352829400784007056018816896201698
61286272752643136005017603010565734420481257472
716210368169344101606425401602709504116121616588846087777314
Technical details
Node id
n-236a5c827b0706e7 · revision 0 · JSON
Definition source
derived:derivative
Fingerprint
f6-c5faa49c64af63fa

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 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 = 0, …, ascending powers of x
%e Example
Triangle begins:
  0:   8,     8;
  1:  18,    72,     24;
  2:  32,   288,    384,      64;
  3:  50,   800,   2400,    1600,      160;
  4:  72,  1800,   9600,   14400,     5760,      384;
  5:  98,  3528,  29400,   78400,    70560,    18816,      896;
  6: 128,  6272,  75264,  313600,   501760,   301056,    57344,     2048;
  7: 162, 10368, 169344, 1016064,  2540160,  2709504,  1161216,   165888,     4608;
  8: 200, 16200, 345600, 2822400, 10160640, 16934400, 12902400,  4147200,   460800,   10240;
  9: 242, 24200, 653400, 6969600, 34151040, 81962496, 97574400, 55756800, 13939200, 1239040, 22528;
%F Formula
The row polynomials satisfy (n^2+2*n+1)*P(n,x) = (n^2+4*n+4+(6*n^2+12*n+4)*x)*P(n-1,x) + ((2*n+3)*x-(4*n+6)*x^2)*d/dx P(n-1,x) for n >= 1, with P(0,x) = 8 + 8*x.
%t Mathematica
P[0, x_] := 8 + 8*x;
P[n_, x_] := P[n, x] = Expand[Together[((n^2 + 4*n + 4 + (6*n^2 + 12*n + 4)*x)*P[n - 1, x] + ((2*n + 3)*x - (4*n + 6)*x^2)*D[P[n - 1, x], x])/(n^2 + 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] = 8 + 8*x; for(n = 1, N, my(i = n + 1); v[i] = ((n^2 + 4*n + 4 + (6*n^2 + 12*n + 4)*x)*v[i - 1] + ((2*n + 3)*x - (4*n + 6)*x^2)*deriv(v[i - 1], x))/(n^2 + 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. [Bra15] Petter Brändén. Unimodality, log-concavity, real-rootedness and beyond. Handbook of enumerative combinatorics, :437–483, March 2015. doi:10.1201/b18255-10
  2. [Fav35] Jean Favard. Sur les polynômes de tchebicheff. C. R. Acad. Sci. Paris, 200:2052–2053, 1935.
  3. [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
  4. [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.
  5. [Sze39] G. Szegő. Orthogonal Polynomials. Colloquium publications, American Mathematical Society, 1939. doi:10.1090/coll/023