A113953 → 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(6 + 12\,x\right)\,P_{n-2}(x) + \left(3 + 6\,x\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 1\)
\(P_{1}(x) = 3 + 6\,x\)

Rows ?

nx0x1x2x3x4x5x6x7x8x9x10x11x12x13x14Pn(1)
011
1369
215483699
3633064682161053
4279176440323888129611259
5121595582916042768298087776120285
6531949896190188374976400464217728466561285227
7232472535301159596287258441433123460320153964827993613732173
81016551263276673984820107440365679364135276828273536106375681679616146723643
944444761999023779913613191206428967932841394758438369894422170931272223488100776961567691901
10194327130065904206195220824053824212120726436668505604300656768337042944016846548484837294086046617616750252683
118496495144390114110017472449543948081462896547229687632704421726383364184987212828370393856124862653443204707328362797056178970728365
123714911168786398857648270242888289835296229154736224292281472374449858560450415904256386763496704230799393792906992640002104222924821767823361912241103579
131624263033254785254297553947121641661227366092113848481603925154720307839068697643551177569284535206744320342834147993618259575828486479555420161371372871681306069401620431643042781
1471017357515311886840151638225660913506050880373660059960010967547318912237969295182723873159112089647461898605824435222232289282936170993766414114256666624456471255859288812719308878364164096218305127249451
Technical details
Node id
n-5f309678edc65efe · revision 0 · JSON
Definition source
derived:basis_map_A013610
Fingerprint
f6-9b5eff8cf8e14211

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:      3,       6;
  2:     15,      48,       36;
  3:     63,     306,      468,       216;
  4:    279,    1764,     4032,      3888,      1296;
  5:   1215,    9558,    29160,     42768,     29808,      7776;
  6:   5319,   49896,   190188,    374976,    400464,    217728,     46656;
  7:  23247,  253530,  1159596,   2872584,   4143312,   3460320,   1539648,    279936;
  8: 101655, 1263276,  6739848,  20107440,  36567936,  41352768,  28273536,  10637568,  1679616;
  9: 444447, 6199902, 37799136, 131912064, 289679328, 413947584, 383698944, 221709312, 72223488, 10077696;
%F Formula
The row polynomials satisfy P(n,x) = (6+12*x)*P(n-2,x) + (3+6*x)*P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 3 + 6*x.
%t Mathematica
P[0, x_] := 1;
P[1, x_] := 3 + 6*x;
P[n_, x_] := P[n, x] = Expand[(6 + 12*x)*P[n - 2, x] + (3 + 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] = 3 + 6*x; for(n = 2, N, my(i = n + 1); v[i] = (6 + 12*x)*v[i - 2] + (3 + 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
  2. [MW08] Shi-Mei Ma and Yi Wang. q-Eulerian polynomials and polynomials with only real zeros. The Electronic Journal of Combinatorics, 15(1):Research Paper 17, January 2008. doi:10.37236/741