A153518 → basis A013611

nonnegative coefficients

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

Recurrence

\(\left(-3 + n\right)\,P_{n}(x) = \left(-15 - 60\,x + 5\,n + 20\,n x\right)\,P_{n-2}(x) + \left(-6 - 12\,x + 2\,n + 4\,n x\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 2\)
\(P_{1}(x) = 10 + 20\,x\)
\(P_{2}(x) = 50 + 200\,x + 32\,x^{2}\)
\(P_{3}(x) = 250 + 1500\,x + 2064\,x^{2} + 128\,x^{3}\)

Rows ?

nx0x1x2x3x4x5x6x7x8x9x10x11x12x13x14Pn(1)
022
1102030
25020032282
3250150020641283942
4750600014288915251230702
527502750092896117376401922048282762
6925011100048723293785673548817510481922464122
73225045150024329446269440777088041062407577603276821853782
8110750177200011328048367045766305408054881280214835203260416131072192725742
9382750688950050938816198727424437169664537927680348405760107773952139591685242881702699002
101319250263850002215158721011293952271861094443600220164053565440205514342452487782459506688209715215034337562
1145522501001495009410558244921064832156427944963102751948838047801344278315335681149560422425003294722527068168388608132773500422
12157007503768180003917989008230931401608478878208020079854592030767394816029920129843217804460032061778165760117073510401069547520335544321172499441582
13541627501408231500160515191361052846769924385853939201208745707520222933147648027292120842242167003086848107814846464032179748864054064578560451307110413421772810354334160042
141868292505231219000648622693124686009114882184116209408687160136192014847986442240220252355297282212510348083214694092111872625028890624016348138700802468431790081899180851253687091291438490999802
Technical details
Node id
n-98886efaea10cd66 · revision 0 · JSON
Definition source
derived:basis_map_A013611
Fingerprint
f6-2aa284a691d23675

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:      2;
  1:     10,      20;
  2:     50,     200,       32;
  3:    250,    1500,     2064,       128;
  4:    750,    6000,    14288,      9152,       512;
  5:   2750,   27500,    92896,    117376,     40192,      2048;
  6:   9250,  111000,   487232,    937856,    735488,    175104,      8192;
  7:  32250,  451500,  2432944,   6269440,   7770880,   4106240,    757760,     32768;
  8: 110750, 1772000, 11328048,  36704576,  63054080,  54881280,  21483520,   3260416,   131072;
  9: 382750, 6889500, 50938816, 198727424, 437169664, 537927680, 348405760, 107773952, 13959168, 524288;
%F Formula
The row polynomials satisfy (n-3)*P(n,x) = (5*n-15+(20*n-60)*x)*P(n-2,x) + (2*n-6+(4*n-12)*x)*P(n-1,x) for n >= 4, with P(0,x) = 2, P(1,x) = 10 + 20*x, P(2,x) = 50 + 200*x + 32*x^2, P(3,x) = 250 + 1500*x + 2064*x^2 + 128*x^3.
%t Mathematica
P[0, x_] := 2;
P[1, x_] := 10 + 20*x;
P[2, x_] := 50 + 200*x + 32*x^2;
P[3, x_] := 250 + 1500*x + 2064*x^2 + 128*x^3;
P[n_, x_] := P[n, x] = Expand[Together[((5*n - 15 + (20*n - 60)*x)*P[n - 2, x] + (2*n - 6 + (4*n - 12)*x)*P[n - 1, x])/(n - 3)]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten
%o PARI/GP
P(N) = {my(v = vector(N + 1)); v[1] = 2; v[2] = 10 + 20*x; v[3] = 50 + 200*x + 32*x^2; v[4] = 250 + 1500*x + 2064*x^2 + 128*x^3; for(n = 4, N, my(i = n + 1); v[i] = ((5*n - 15 + (20*n - 60)*x)*v[i - 2] + (2*n - 6 + (4*n - 12)*x)*v[i - 1])/(n - 3)); 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

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