A113413 → basis A013610 → basis A013609

nonnegative coefficients

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

Recurrence

\(P_{n}(x) = \left(4 + 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
2347236142
31946246482161682
41106477675605184129619922
56306341767279276032388807776235962
635954234456627912883008686880279936466562794802
720499415625445042520892339293441605785344195955227993633102442
811687861019623238506248821715841083067209023270446376064134369281679616392074882
96663906654740162832539767078440961125480096118021017681582681635831808090699264100776964643848122
103799467441515116020243163605798468160108007214401366470259211887295616701855539226907448326046617606046617655003078162
11216628994260560334414138348760456691392009754340112014460156288015176926195211274478387258077762048197522841603990767616362797056651472341002
121235123666162163633689691353626434851555936083972553552014277313601281755993085056157373748633610197318251524657911091201423373783042612138803221767823367716226532642
13704213430610021474617665405287663225915656637446953909473440133406766720001882104001113619766240649216154498637952008874822205440364091032166410100270039041697890222081306069401691393215269082
144015116619461560273218443565051854801885768903353655768936847904119176118854272189739620588672228588351768576209368115089920145054849185792748175810088962785410677145670745425920001097098297344783641640961082487633286322
Technical details
Node id
n-450cfba591249146 · revision 0 · JSON
Definition source
derived:basis_map_A013609
Fingerprint
f6-65e7907e2a8fdd0f

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:      34,       72,        36;
  3:     194,      624,       648,       216;
  4:    1106,     4776,      7560,      5184,       1296;
  5:    6306,    34176,     72792,     76032,      38880,       7776;
  6:   35954,   234456,    627912,    883008,     686880,     279936,     46656;
  7:  204994,  1562544,   5042520,   8923392,    9344160,    5785344,   1959552,    279936;
  8: 1168786, 10196232,  38506248,  82171584,  108306720,   90232704,  46376064,  13436928,  1679616;
  9: 6663906, 65474016, 283253976, 707844096, 1125480096, 1180210176, 815826816, 358318080, 90699264, 10077696;
%F Formula
The row polynomials satisfy P(n,x) = (4+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[(4 + 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] = (4 + 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