A116412 → basis A013609 → basis A007318

nonnegative coefficients

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

Recurrence

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

Rows ?

nx0x1x2x3x4x5x6x7Pn(1)
011
1628
23324461
3183204728467
410141524828192163574
5561910626781227844803227353
6311377096865844317768400115264209341
71725424602305158443145441125602361626881281602152
Technical details
Node id
n-aab23e9f5384c233 · revision 0 · JSON
Definition source
derived:basis_map_A007318
Fingerprint
f6-20bdec796f87d0c7

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:       6,        2;
  2:      33,       24,        4;
  3:     183,      204,       72,        8;
  4:    1014,     1524,      828,      192,       16;
  5:    5619,    10626,     7812,     2784,      480,      32;
  6:   31137,    70968,    65844,    31776,     8400,    1152,      64;
  7:  172542,   460230,   515844,   314544,   112560,   23616,    2688,    128;
  8:  956121,  2921412,  3839148,  2831424,  1280640,  363456,   63168,   6144,   256;
  9: 5298231, 18245076, 27506556, 23810736, 13032816, 4674528, 1098048, 162816, 13824, 512;
%F Formula
The row polynomials satisfy P(n,x) = (3+2*x)*P(n-2,x) + (5+2*x)*P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 6 + 2*x.
%t Mathematica
P[0, x_] := 1;
P[1, x_] := 6 + 2*x;
P[n_, x_] := P[n, x] = Expand[(3 + 2*x)*P[n - 2, x] + (5 + 2*x)*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] = 6 + 2*x; for(n = 2, N, my(i = n + 1); v[i] = (3 + 2*x)*v[i - 2] + (5 + 2*x)*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

Candidate equalities ?

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