A153518 → basis A013609

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 - 30\,x + 5\,n + 10\,n x\right)\,P_{n-2}(x) + \left(-6 - 6\,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}\)
\(P_{3}(x) = 250 + 750\,x + 516\,x^{2} + 16\,x^{3}\)

Rows ?

nx0x1x2x3x4x5x6x7x8x9x10x11x12x13x14Pn(1)
022
1101020
2501008158
3250750516161532
4750300035721144328498
5275013750232241467225126456972
6925055500121808117232459685472128355358
732250225750608236783680485680128320118402562276012
811075088600028320124588072394088017150403356802547251214434418
9382750344475012734704248409282732310416810240544384084198454528102491877852
1013192501319250055378968126411744169913184136250688633369601605580820503041162242048584027678
1145522505007475023526395661513310497767465696960998459449689621743385644904704488345624678440963714278492
12157007501884090009794972522886642520529929888062749545604807405440233751014469548672012066048011432960522240819223617529138
1354162750704115750401287978413160584624274115871203777330336034833304320213219694088464855808210575872031425536026398720110182416384150184293932
14186829250261560950016215567328585751139361365072630882147375425602319997881601720721525768642618547228699398656610379776079824896060264448231833632768955000112798
Technical details
Node id
n-5fc6172728a1754c · revision 0 · JSON
Definition source
derived:basis_map_A013609
Fingerprint
f6-2fb91d8b80545e88

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:    750,    3000,     3572,     1144,       32;
  5:   2750,   13750,    23224,    14672,     2512,       64;
  6:   9250,   55500,   121808,   117232,    45968,     5472,     128;
  7:  32250,  225750,   608236,   783680,   485680,   128320,   11840,    256;
  8: 110750,  886000,  2832012,  4588072,  3940880,  1715040,  335680,  25472,   512;
  9: 382750, 3444750, 12734704, 24840928, 27323104, 16810240, 5443840, 841984, 54528, 1024;
%F Formula
The row polynomials satisfy (n-3)*P(n,x) = (5*n-15+(10*n-30)*x)*P(n-2,x) + (2*n-6+(2*n-6)*x)*P(n-1,x) for n >= 4, with P(0,x) = 2, P(1,x) = 10 + 10*x, P(2,x) = 50 + 100*x + 8*x^2, P(3,x) = 250 + 750*x + 516*x^2 + 16*x^3.
%t Mathematica
P[0, x_] := 2;
P[1, x_] := 10 + 10*x;
P[2, x_] := 50 + 100*x + 8*x^2;
P[3, x_] := 250 + 750*x + 516*x^2 + 16*x^3;
P[n_, x_] := P[n, x] = Expand[Together[((5*n - 15 + (10*n - 30)*x)*P[n - 2, x] + (2*n - 6 + (2*n - 6)*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 + 10*x; v[3] = 50 + 100*x + 8*x^2; v[4] = 250 + 750*x + 516*x^2 + 16*x^3; for(n = 4, N, my(i = n + 1); v[i] = ((5*n - 15 + (10*n - 30)*x)*v[i - 2] + (2*n - 6 + (2*n - 6)*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