A059473 → basis A013609 → basis A013609

nonnegative coefficients

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

Recurrence

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

Rows ?

nx0x1x2x3x4x5x6x7Pn(1)
011
18816
27013664270
3608176016645124544
45284203202886417920409676484
545920220256417536390656180224327681287360
63990642293600543808068039684734976173670426214421668536
7346803223230208661207041036206089651814453411840162529282097152364719616
Technical details
Node id
n-5b9cdf460c0c44ab · revision 0 · JSON
Definition source
derived:basis_map_A013609
Fingerprint
f6-8b454b2cd1297229

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:         8,          8;
  2:        70,        136,         64;
  3:       608,       1760,       1664,         512;
  4:      5284,      20320,      28864,       17920,        4096;
  5:     45920,     220256,     417536,      390656,      180224,       32768;
  6:    399064,    2293600,    5438080,     6803968,     4734976,     1736704,      262144;
  7:   3468032,   23230208,   66120704,   103620608,    96518144,    53411840,    16252928,    2097152;
  8:  30138640,  230540032,  765784576,  1442258944,  1683951616,  1247739904,   572784640,  148897792,   16777216;
  9: 261917312, 2252554880, 8553162752, 18815037440, 26417758208, 24546148352, 15089008640, 5916065792, 1342177280, 134217728;
%F Formula
The row polynomials satisfy P(n,x) = (6+8*x)*P(n-2,x) + (8+8*x)*P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 8 + 8*x.
%t Mathematica
P[0, x_] := 1;
P[1, x_] := 8 + 8*x;
P[n_, x_] := P[n, x] = Expand[(6 + 8*x)*P[n - 2, x] + (8 + 8*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] = 8 + 8*x; for(n = 2, N, my(i = n + 1); v[i] = (6 + 8*x)*v[i - 2] + (8 + 8*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

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