A081578 → basis A013609 → basis A013611

nonnegative coefficients

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

Recurrence

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

Rows ?

nx0x1x2x3x4x5x6x7x8x9x10x11x12x13x14Pn(1)
011
14812
2258864177
313672011525122520
476953601305612800409636081
543003733612275218790413107232768516132
62412125044010358402162176237158412779522621447384257
713518416339528147712215726083247308827525120120586242097152105643440
87578251045014460995584195791872375709696438304768301465600111149056167772161511401761
942479566581316044012774416608307203879174144578597683254814310403164602368100663296013421772821623054652
1023812249409475384308677996813390365696368837345286713907609681446043648647453736963216192307289925877761073741824309352913937
11133480600252266891221163588480103766244864329430368256708800151552105109310668810705856102407316208353283186328862727945689497685899345924425795770760
127482326411541529288014244413414477896969779228011738193926960104865792122191258583041522850070528013334514499584798031767142430923764531206957847019526871947673663318195409041
134194255964935545872569441152298245697254191616228917160509446453534022041613102838395699219352851474022420744470580428815902398270668884574348509184295064253235206047313952768549755813888905869605343572
14235111176255644676160406176861853760407713251046401810507348582405711442047467521317410907095040225265665756364828635015885619202687504784293888182984826788249687509958656000027755796653670452226802319360439804651110412959935712621217
Technical details
Node id
n-5792775bd59b2e5c · revision 0 · JSON
Definition source
derived:basis_map_A013611
Fingerprint
f6-df0057f2ca9fd374

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:       4,        8;
  2:      25,       88,        64;
  3:     136,      720,      1152,        512;
  4:     769,     5360,     13056,      12800,       4096;
  5:    4300,    37336,    122752,     187904,     131072,      32768;
  6:   24121,   250440,   1035840,    2162176,    2371584,    1277952,     262144;
  7:  135184,  1633952,   8147712,   21572608,   32473088,   27525120,   12058624,    2097152;
  8:  757825, 10450144,  60995584,  195791872,  375709696,  438304768,  301465600,  111149056,   16777216;
  9: 4247956, 65813160, 440127744, 1660830720, 3879174144, 5785976832, 5481431040, 3164602368, 1006632960, 134217728;
%F Formula
The row polynomials satisfy P(n,x) = (9+24*x)*P(n-2,x) + (4+8*x)*P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 4 + 8*x.
%t Mathematica
P[0, x_] := 1;
P[1, x_] := 4 + 8*x;
P[n_, x_] := P[n, x] = Expand[(9 + 24*x)*P[n - 2, x] + (4 + 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] = 4 + 8*x; for(n = 2, N, my(i = n + 1); v[i] = (9 + 24*x)*v[i - 2] + (4 + 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