A156365 → reverse

nonnegative coefficients

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

Recurrence

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

Rows ?

nx0x1x2x3x4x5x6x7x8x9x10x11x12x13x14x15x16Pn(1)
048113
184422175
216208264521541
3329122416120811414683
464384019056193284764240147293
512815808137376249904124952171724941545835
6256642569349122823488249904070587258432100417087261
75122593286123520291322884193132820965664364153619136020261102247563
8102410424323907507228204646462323929650317593615580982417627904610548407211622632573
9204841809922448747522608047360848876467210400786304520039315210610955848150148019130848166128091567595
104096167485441515239424233131264001083600729601927195530241456110082564817988825667725045603642676005918904163561526858348381
11819267047424929241907220317264486413167319936003287875292928358031053977617901552698884109844116164114787480015872862881814925632738110641342970443
121638426830438456626130944173689018777615402219029504526218234511367971522519321657284968636416199288062983043288863965696240659672336678472729655298956655041230283190977853
1332768107346329634351304704014631261204480174864872548352800886290738176164223138721638416339965249216008169982624608002052789234020482502769658556813661318167842857668204016773098013103815315654681981355
14655364294377472207718023168012185927229440019388551211417601170901395943833631800988619149312425662582709094402941193744858880010641564567727360198756178869683218295334311622475736528169601190031956005071240802621081130370767029135901
Technical details
Node id
n-a2b074a65f23d202 · revision 0 · JSON
Definition source
derived:reversal
Fingerprint
f6-735f72d4be30f803

Observed on the stored rows ?

  • Degrees: 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16 (affine: slope 1, intercept 2)
  • 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:    4,       8,         1;
  1:    8,      44,        22,          1;
  2:   16,     208,       264,         52,          1;
  3:   32,     912,      2416,       1208,        114,           1;
  4:   64,    3840,     19056,      19328,       4764,         240,          1;
  5:  128,   15808,    137376,     249904,     124952,       17172,        494,          1;
  6:  256,   64256,    934912,    2823488,    2499040,      705872,      58432,       1004,        1;
  7:  512,  259328,   6123520,   29132288,   41931328,    20965664,    3641536,     191360,     2026,       1;
  8: 1024, 1042432,  39075072,  282046464,  623239296,   503175936,  155809824,   17627904,   610548,    4072,    1;
  9: 2048, 4180992, 244874752, 2608047360, 8488764672, 10400786304, 5200393152, 1061095584, 81501480, 1913084, 8166, 1;
%F Formula
The row polynomials satisfy P(n,x) = (2+(n+2)*x)*P(n-1,x) + (2*x-x^2)*d/dx P(n-1,x) for n >= 1, with P(0,x) = 4 + 8*x + x^2.
%t Mathematica
P[0, x_] := 4 + 8*x + x^2;
P[n_, x_] := P[n, x] = Expand[(2 + (n + 2)*x)*P[n - 1, x] + (2*x - 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] = 4 + 8*x + x^2; for(n = 1, N, my(i = n + 1); v[i] = (2 + (n + 2)*x)*v[i - 1] + (2*x - 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. [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