A008306 → basis A013609

nonnegative coefficients

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

Recurrence

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

Rows ?

nx0x1x2x3x4x5x6x7Pn(1)
011
122
29615
3444084
426532060645
5185426888405382
614833247661078084051219
713349624929613596820160538920
8133496127335521766520383040151206233193
9146845703249840024010800675136055440078499530
10176214841416920614343688664117341840146916003326401069190199
1122907929325745457848519235516820653776003449846401729728015656265468
123207110104984692505872828085057803731125798477266789606111705608648640245229868845
1348106651573413302736941761392884873016696658842880170833863200184581196806054048004090781313486
14769706425174522186626032190246761758581001349380668636037977458719205178397224002754591840025945920072397063800315
Technical details
Node id
n-850ad8a1478de773 · revision 0 · JSON
Definition source
derived:basis_map_A013609
Fingerprint
f6-96601b99a53d74c6

Observed on the stored rows ?

  • Degrees: 0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7 (half 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:        9,        6;
  3:       44,       40;
  4:      265,      320,       60;
  5:     1854,     2688,      840;
  6:    14833,    24766,    10780,     840;
  7:   133496,   249296,   135968,   20160;
  8:  1334961,  2733552,  1766520,  383040,  15120;
  9: 14684570, 32498400, 24010800, 6751360, 554400;
%F Formula
The row polynomials satisfy P(n,x) = (n+1+(2*n+2)*x)*P(n-2,x) + (n+1)*P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 2.
%t Mathematica
P[0, x_] := 1;
P[1, x_] := 2;
P[n_, x_] := P[n, x] = Expand[(n + 1 + (2*n + 2)*x)*P[n - 2, x] + (n + 1)*P[n - 1, x]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten
%o PARI/GP
P(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = 2; for(n = 2, N, my(i = n + 1); v[i] = (n + 1 + (2*n + 2)*x)*v[i - 2] + (n + 1)*v[i - 1]); 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