A088617 → basis A007318

nonnegative coefficients

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

Recurrence

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

Rows ?

nx0x1x2x3x4x5x6x7x8x9x10x11x12x13x14Pn(1)
111
2213
367215
4224125593
5902312199114645
6394128916661064336424791
71806718311780102004920125413237275
8855840081797318734556925220774719429299865
941586224143524405695695572495299299970971787514302474025
1020609812564653380740526988052452403457454150950842099268068486220819307
111037718705973521477510384805204496856035818146196953127383168180601226033816796178003815
12529344639753273134930445273241605366832830342842136227631768107379480352716007684170999362587861541918901
13272977382242982318403135511898128155287929950030901720082406182856136972413656577972016539215032481526384822220801213503125805
141420787461267854873519672807012954973680219156220802656832943623747740368158469484807895121300290063367076390921213657473614858000742900119352115551
157453870387178461215319543582808714657640016267882488021989308083622195883767216996960780899230045772439535447781454140573634844981605717358405750046026744401063366539315

Other recurrences

Image under the basis map A007318 · proved equal for all n (proof step)

\(\left(n\right)\,P_{n}(x) = \left(3 - n\right)\,P_{n-2}(x) + \left(-9 - 6\,x + 6\,n + 4\,n x\right)\,P_{n-1}(x)\)
\(P_{1}(x) = 1\)
\(P_{2}(x) = 2 + x\)
Technical details
Node id
n-3ce0bead7a116750 · revision 0 · JSON
Definition source
derived:shift_x_plus_one
derived:basis_map_A007318 (equal by e-907ff3ac724c18dd)
Fingerprint
f6-e4c3b23b17de5bef

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,       1;
   3:      6,       7,       2;
   4:     22,      41,      25,       5;
   5:     90,     231,     219,      91,      14;
   6:    394,    1289,    1666,    1064,     336,      42;
   7:   1806,    7183,   11780,   10200,    4920,    1254,     132;
   8:   8558,   40081,   79731,   87345,   56925,   22077,    4719,    429;
   9:  41586,  224143,  524405,  695695,  572495,  299299,   97097,  17875,  1430;
  10: 206098, 1256465, 3380740, 5269880, 5245240, 3457454, 1509508, 420992, 68068, 4862;
%F Formula
The row polynomials satisfy n*P(n,x) = (3*n-2+(2*n-2)*x)*P(n-1,x) + (4+6*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[((3*n - 2 + (2*n - 2)*x)*P[n - 1, x] + (4 + 6*x + 2*x^2)*D[P[n - 1, x], x])/(n)]];
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] = ((3*n - 2 + (2*n - 2)*x)*v[i - 1] + (4 + 6*x + 2*x^2)*deriv(v[i - 1], x))/(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. [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. [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.