A116412 → basis A013609 → basis A013610

nonnegative coefficients

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

Recurrence

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

Rows ?

nx0x1x2x3x4x5x6x7x8x9x10x11x12x13x14Pn(1)
011
16612
2337236141
31836126482161659
41014457274525184129619518
55619318787030875168388807776229629
631137212904592596857952680400279936466562701581
717254213806904642596849268891173605738688195955227993631784052
8956121876423634552332764484481037318408831980846049472134369281679616373938801
95298231547352282475590046428898721055658096113591030480047699235607859290699264100776964399383279
10293595183374949601722448800513646272099055159201290085056011485914048689986252826756282886046617606046617651758665278
11162692283205962697811708302140394310300408737066944013367902780814405156640010928589465657185885952196515072003990767616362797056608939767569
1290153996912462930576780915887282931490440007339748515201290754802880163419484435215003539435529910708577284592406067201416722503682612138803221767823367164165430761
1349957766947487892732651271819538421228376553285927466710160117828842235841714973190508818499105866240147847509757448644698017280359368623820810056734392321697890222081306069401684286277646492
14276835033774471673283363321916890516150384941133124633517830132810275533489664016909307821728020970015165849619689372631065613925614290739273017079686144275188822917127046244421632109709829734478364164096991626542988261
Technical details
Node id
n-52b333099934422f · revision 0 · JSON
Definition source
derived:basis_map_A013610
Fingerprint
f6-ca626fb9a6ac4d2d

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,        6;
  2:      33,       72,        36;
  3:     183,      612,       648,       216;
  4:    1014,     4572,      7452,      5184,       1296;
  5:    5619,    31878,     70308,     75168,      38880,       7776;
  6:   31137,   212904,    592596,    857952,     680400,     279936,     46656;
  7:  172542,  1380690,   4642596,   8492688,    9117360,    5738688,   1959552,    279936;
  8:  956121,  8764236,  34552332,  76448448,  103731840,   88319808,  46049472,  13436928,  1679616;
  9: 5298231, 54735228, 247559004, 642889872, 1055658096, 1135910304, 800476992, 356078592, 90699264, 10077696;
%F Formula
The row polynomials satisfy P(n,x) = (3+6*x)*P(n-2,x) + (5+6*x)*P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 6 + 6*x.
%t Mathematica
P[0, x_] := 1;
P[1, x_] := 6 + 6*x;
P[n_, x_] := P[n, x] = Expand[(3 + 6*x)*P[n - 2, x] + (5 + 6*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 + 6*x; for(n = 2, N, my(i = n + 1); v[i] = (3 + 6*x)*v[i - 2] + (5 + 6*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