A153648 → basis A013609

nonnegative coefficients

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

Recurrence

\(\left(-2 + n\right)\,P_{n}(x) = \left(-30 - 60\,x + 15\,n + 30\,n x\right)\,P_{n-2}(x) + \left(-4 - 4\,x + 2\,n + 2\,n x\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 2\)
\(P_{1}(x) = 10 + 10\,x\)
\(P_{2}(x) = 50 + 100\,x + 8\,x^{2}\)

Rows ?

nx0x1x2x3x4x5x6x7x8x9x10x11x12x13x14Pn(1)
022
1101020
2501008158
3250750516161532
412505000565213043213238
56250312505154429632315264121892
63125018750040036835147210516873921281083278
71562501093750288639634944801849520320640169602569818252
8781250625000019590812300448722280968076062408988803827251288020518
9390625035156250127790064238280448238286304121127040268838402386944852481024793903412
101953125019531250080725480817705384642196624864151721068853769216086082048610022418790420487136536958
1197656250107421875049766730761256349518418657034656163931658248146874496208986777625725158415149056410624409664271801372
1248828125058593750003006998077285856057720148506586560158757307200102661783680378954800647368203520730626560367872008908808192578231368598
13244140625031738281250178735370184569604697024112548566392014201363145601136836273920556868779008157082174208241424435201995458560877363201921024163845205156536132
141220703125017089843750010477782644483686620423376819346125188811927801161760114165911481607035695817216267528936115259445473945674746408960528336896020616396841205763276846841037731438
Technical details
Node id
n-51e00fb280b8d256 · revision 0 · JSON
Definition source
derived:basis_map_A013609
Fingerprint
f6-835f2c52ab764e58

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,       10;
  2:      50,      100,         8;
  3:     250,      750,       516,        16;
  4:    1250,     5000,      5652,      1304,        32;
  5:    6250,    31250,     51544,     29632,      3152,        64;
  6:   31250,   187500,    400368,    351472,    105168,      7392,      128;
  7:  156250,  1093750,   2886396,   3494480,   1849520,    320640,    16960,     256;
  8:  781250,  6250000,  19590812,  30044872,  22809680,   7606240,   898880,   38272,   512;
  9: 3906250, 35156250, 127790064, 238280448, 238286304, 121127040, 26883840, 2386944, 85248, 1024;
%F Formula
The row polynomials satisfy (n-2)*P(n,x) = (15*n-30+(30*n-60)*x)*P(n-2,x) + (2*n-4+(2*n-4)*x)*P(n-1,x) for n >= 3, with P(0,x) = 2, P(1,x) = 10 + 10*x, P(2,x) = 50 + 100*x + 8*x^2.
%t Mathematica
P[0, x_] := 2;
P[1, x_] := 10 + 10*x;
P[2, x_] := 50 + 100*x + 8*x^2;
P[n_, x_] := P[n, x] = Expand[Together[((15*n - 30 + (30*n - 60)*x)*P[n - 2, x] + (2*n - 4 + (2*n - 4)*x)*P[n - 1, x])/(n - 2)]];
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 + 10*x; v[3] = 50 + 100*x + 8*x^2; for(n = 3, N, my(i = n + 1); v[i] = ((15*n - 30 + (30*n - 60)*x)*v[i - 2] + (2*n - 4 + (2*n - 4)*x)*v[i - 1])/(n - 2)); 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