A008288 → basis A013610 → basis A013611

nonnegative coefficients

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

Recurrence

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

Rows ?

nx0x1x2x3x4x5x6x7Pn(1)
111
251217
329132144305
41651116244817285457
5941843627792397442073697649
65365599162633765685126013442488321747345
73058940899622482726495552103887368709120298598431267249
81744052716092179218086489158413911782417642188812242534435831808559500753
Technical details
Node id
n-43c399e2a98269df · revision 0 · JSON
Definition source
derived:basis_map_A013611
Fingerprint
f6-eff727d82afb07a1

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 -1)
  • 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 = 1, …, ascending powers of x
%e Example
Triangle begins:
   1:       1;
   2:       5,        12;
   3:      29,       132,       144;
   4:     165,      1116,      2448,       1728;
   5:     941,      8436,     27792,      39744,       20736;
   6:    5365,     59916,    263376,     568512,      601344,      248832;
   7:   30589,    408996,   2248272,    6495552,    10388736,     8709120,     2985984;
   8:  174405,   2716092,  17921808,   64891584,   139117824,   176421888,   122425344,    35831808;
   9:  994381,  17676372, 136103184,  592481088,  1593789696,  2711024640,  2845642752,  1684094976,   429981696;
  10: 5669525, 113271660, 996912720, 5070271680, 16413891840, 35055700992, 49367273472, 44180619264, 22789029888, 5159780352;
%F Formula
The row polynomials satisfy P(n,x) = (4+12*x)*P(n-2,x) + (5+12*x)*P(n-1,x) for n >= 3, with P(1,x) = 1, P(2,x) = 5 + 12*x.
%t Mathematica
P[1, x_] := 1;
P[2, x_] := 5 + 12*x;
P[n_, x_] := P[n, x] = Expand[(4 + 12*x)*P[n - 2, x] + (5 + 12*x)*P[n - 1, x]];
Table[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten
%o PARI/GP
P(N) = {my(v = vector(N)); v[1] = 1; v[2] = 5 + 12*x; for(n = 3, N, my(i = n); v[i] = (4 + 12*x)*v[i - 2] + (5 + 12*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, v[i])))};
T(10)

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