A357367 → x ↦ x+1

nonnegative coefficients

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

Recurrence

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

Rows ?

nx0x1x2x3x4x5x6x7x8x9x10x11x12x13x14Pn(1)
011
1224
218301260
32646244801201488
4540016560187209240168051600
5141840534960796320584640211680302402299680
64551120203767203759840036590400198072005654880665280125244000
7172529280894297600196826112023841216001716422400734469120172972800172972808060371200
875453638404444118784011359595520016457696640014781191040084272348160297859161605967561600518918400598516128000
93739442112002466702201600718039365120012105488102400130258896768009277223155200437344427520013159770624002293619328001764322560050366067494400
1020711190931200151256610489600493929445363200949701623270400119065930663680010170437397120005994379302912002407241700864006303924506880097214173056006704425728004736895121728000
111267784551756800101548329619968003675947372697600079377795649152000113609441417472000113163001388236800800474556930048004021173405849600014059180751616000325835090380800045053740892160028158588057600492387747099494400
1284991791159475200740850770499840000294425446996961280070540394964399360001134755094087014400012912236152226611200106568399550412800006427905711504076800281225852914406400087038195686041600018089076968202240022667663386368000129529505064960056056163501834496000
13619309114605941760058361256231896217600252605019029755392000664914660953647104000118752214526455910400015196129492619851776001433428018075326873600100918464814450483200053030421241352755200020542562904248985600057021478719696691200107405865599864832001230530298117120000647647525324800006936608989894084300800
14487361761916020992000493722574722682905600023117879626977687552000663136799294502973440001301882968998600468480001850455890609329203200001963764196118017413120001580691813162398576640009697815277240278988800045129679254019616256000156813340952833044480003945339194773616640000679447018818247680000716945810534553600003497296636753920000927024778167393185280000

Other recurrences

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

\(P_{n}(x) = \left(2\,n - n^{2}\right)\,P_{n-2}(x) + \left(-3 - 2\,x + 6\,n + 4\,n x\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 1\)
\(P_{1}(x) = 2 + 2\,x\)
Technical details
Node id
n-79beb834849e7646 · revision 0 · JSON
Definition source
derived:shift_x_plus_one
derived:basis_map_A007318 (equal by e-d6bf80c66f6fc720)
Fingerprint
f6-8f228763548ec508

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:            2,             2;
  2:           18,            30,            12;
  3:          264,           624,           480,            120;
  4:         5400,         16560,         18720,           9240,           1680;
  5:       141840,        534960,        796320,         584640,         211680,         30240;
  6:      4551120,      20376720,      37598400,       36590400,       19807200,       5654880,        665280;
  7:    172529280,     894297600,    1968261120,     2384121600,     1716422400,     734469120,     172972800,      17297280;
  8:   7545363840,   44441187840,  113595955200,   164576966400,   147811910400,   84272348160,   29785916160,    5967561600,    518918400;
  9: 373944211200, 2466702201600, 7180393651200, 12105488102400, 13025889676800, 9277223155200, 4373444275200, 1315977062400, 229361932800, 17643225600;
%F Formula
The row polynomials satisfy P(n,x) = (3*n-1+2*n*x)*P(n-1,x) + (4+6*x+2*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[(3*n - 1 + 2*n*x)*P[n - 1, x] + (4 + 6*x + 2*x^2)*D[P[n - 1, x], x]];
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 + 2*n*x)*v[i - 1] + (4 + 6*x + 2*x^2)*deriv(v[i - 1], x)); 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. [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.