A206306 → basis A013610

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(4 - 2\,n\right)\,P_{n-2}(x) + \left(-8 - 6\,x + 4\,n + 3\,n x\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 1\)
\(P_{1}(x) = 1 + 3\,x\)
\(P_{2}(x) = 4 + 15\,x + 9\,x^{2}\)

Rows ?

nx0x1x2x3x4x5x6x7Pn(1)
011
1134
2415928
314668127188
448276504351811260
516411162682286213772438444
65604404130681879213932510372956588
71912170646012010864810935061722182252187379228
Technical details
Node id
n-74ec83953eae1292 · revision 0 · JSON
Definition source
derived:basis_map_A013610
Fingerprint
f6-ff1dc72e140f0934

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:     1;
  1:     1,      3;
  2:     4,     15,       9;
  3:    14,     66,      81,      27;
  4:    48,    276,     504,     351,      81;
  5:   164,   1116,    2682,    2862,    1377,     243;
  6:   560,   4404,   13068,   18792,   13932,    5103,     729;
  7:  1912,  17064,   60120,  108648,  109350,   61722,   18225,    2187;
  8:  6528,  65184,  265536,  577368,  735480,  564732,  256608,   63423,   6561;
  9: 22288, 246192, 1137456, 2888784, 4455324, 4341924, 2684178, 1019142, 216513, 19683;
%F Formula
The row polynomials satisfy (n-2)*P(n,x) = -(2*n-4)*P(n-2,x) + (4*n-8+(3*n-6)*x)*P(n-1,x) for n >= 3, with P(0,x) = 1, P(1,x) = 1 + 3*x, P(2,x) = 4 + 15*x + 9*x^2.
%t Mathematica
P[0, x_] := 1;
P[1, x_] := 1 + 3*x;
P[2, x_] := 4 + 15*x + 9*x^2;
P[n_, x_] := P[n, x] = Expand[Together[(-(2*n - 4)*P[n - 2, x] + (4*n - 8 + (3*n - 6)*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] = 1; v[2] = 1 + 3*x; v[3] = 4 + 15*x + 9*x^2; for(n = 3, N, my(i = n + 1); v[i] = (-(2*n - 4)*v[i - 2] + (4*n - 8 + (3*n - 6)*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