A011973 → basis A013611 → basis A007318

nonnegative coefficients

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

Recurrence

\(\left(4\,n\right)\,P_{n}(x) = \left(-40 - 32\,x + 44\,n + 32\,n x\right)\,P_{n-1}(x) + \left(-105 - 164\,x - 64\,x^{2}\right)\,P_{n-1}'(x)\)
\(P_{0}(x) = 1\)

Rows ?

nx0x1x2x3x4x5x6x7Pn(1)
011
111
26410
311819
4415216109
59613648280
6301560336641261
7781162411202563781
8228656285040192025615130
9619116872171367680128049159
1017621541566484837440102401024185329
1148576163280218016144384473606144627760
121366815045447588805909762483205222440962295721
133795611515248250208021849601062656272384286727945561
141062966458469283146568175360466816015267842580481638428607050

Other recurrences

Image under the basis map A007318 · proved equal for all n (proof step)

\(P_{n}(x) = \left(5 + 4\,x\right)\,P_{n-2}(x) + \left(1\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 1\)
\(P_{1}(x) = 1\)
Technical details
Node id
n-d945d6c9616de0d7 · revision 0 · JSON
Definition source
derived:shift_x_plus_one
derived:basis_map_A007318 (equal by e-ba56ecf6342e94db)
Fingerprint
f6-7bd50a5129aedca7

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:    1;
  2:    6,     4;
  3:   11,     8;
  4:   41,    52,    16;
  5:   96,   136,    48;
  6:  301,   560,   336,   64;
  7:  781,  1624,  1120,  256;
  8: 2286,  5628,  5040, 1920,  256;
  9: 6191, 16872, 17136, 7680, 1280;
%F Formula
The row polynomials satisfy 4*n*P(n,x) = (44*n-40+(32*n-32)*x)*P(n-1,x) - (105+164*x+64*x^2)*d/dx P(n-1,x) for n >= 1, with P(0,x) = 1.
%t Mathematica
P[0, x_] := 1;
P[n_, x_] := P[n, x] = Expand[Together[((44*n - 40 + (32*n - 32)*x)*P[n - 1, x] - (105 + 164*x + 64*x^2)*D[P[n - 1, x], x])/(4*n)]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten
%o PARI/GP
P(N) = {my(v = vector(N + 1)); v[1] = 1; for(n = 1, N, my(i = n + 1); v[i] = ((44*n - 40 + (32*n - 32)*x)*v[i - 1] - (105 + 164*x + 64*x^2)*deriv(v[i - 1], x))/(4*n)); 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