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

Rows ?

nx0x1x2x3x4x5x6x7Pn(1)
011
14610
215483699
357276432216981
421614043348345612969720
58196678214203369625920777696309
631053045612279626006430456018662446656954261
71177213494665545217465762754000256608013063682799369455130
Technical details
Node id
n-5b243b5debb006bb · revision 0 · JSON
Definition source
derived:basis_map_A013610
Fingerprint
f6-bd18451f68279258

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,       6;
  2:     15,      48,       36;
  3:     57,     276,      432,      216;
  4:    216,    1404,     3348,     3456,      1296;
  5:    819,    6678,    21420,    33696,     25920,      7776;
  6:   3105,   30456,   122796,   260064,    304560,    186624,     46656;
  7:  11772,  134946,   655452,  1746576,   2754000,   2566080,   1306368,    279936;
  8:  44631,  585468,  3327156, 10689408,  21215520,  26609472,  20575296,   8957952,  1679616;
  9: 169209, 2499660, 16270308, 61203600, 146524464, 231343776, 240698304, 159003648, 60466176, 10077696;
%F Formula
The row polynomials satisfy P(n,x) = (3+6*x)*P(n-2,x) + (3+6*x)*P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 4 + 6*x.
%t Mathematica
P[0, x_] := 1;
P[1, x_] := 4 + 6*x;
P[n_, x_] := P[n, x] = Expand[(3 + 6*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] = 4 + 6*x; for(n = 2, N, my(i = n + 1); v[i] = (3 + 6*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