A120909 → basis A008277

nonnegative coefficients

Proved for all n: all roots real, in (−∞, 0] · coefficients of one sign · Hadamard kernel what this means

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

Rows ?

nx0x1x2x3x4x5x6x7x8x9x10x11x12x13x14Pn(1)
033
19615
227481287
38129418024579
424316321848576484347
5729864616200888016809636231
6218744688130692112320362404608192330927
7656122781410042201272264623280132384120963843279003
8196831152192748516813458816940060829675524462083072076834961715
95904958003265470056013609968013032432057379392126282241414656760321536398483775
101771472911972839450457213342982401705766880100658073630418214449305600427392018432030724828396359
1153144114595293428197714601279769330421432032160164970833286575893632144655948817981568012418560439296614461908197427
1215943237308275522003030608812081878265626134774036825732614758413163257113637743298560630961689662042112034940928103219212288836597291691
134782969365732640614167379772011274296560803116462709360386793539932824891408622089049012177921953693181442564807731220444835849568665623961602457611874365738295
14143489071829619796899903123685210430214500160365359491151205651608560998445072983731776203616024268805521819480320929348259840983192770566481133568256069632550502449152176490406942239

Computed in your browser ?

Technical details
Node id
n-20d6880016d8135a · revision 1 · JSON
Definition source
derived:basis_map_A008277
Fingerprint
f6-5162632e955115eb

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

OEIS matches ?

No OEIS matches.

OEIS submission text ?

Fields to paste into an OEIS submission: the example %e, the formula %F and programs %t (Mathematica) and %o (PARI/GP) that list the same rows. For an OEIS link the row numbers, the offset and the orientation are those of the entry, as matched; the matched terms were compared with the published ones, which identifies the node with the entry on a finite prefix, not for every n. The PARI/GP program is not machine-checked here.

The atlas's own rows: n = 0, …, ascending powers of x
%e Example
Triangle begins:
  0:     3;
  1:     9,       6;
  2:    27,      48,       12;
  3:    81,     294,      180,        24;
  4:   243,    1632,     1848,       576,        48;
  5:   729,    8646,    16200,      8880,      1680,       96;
  6:  2187,   44688,   130692,    112320,     36240,     4608,      192;
  7:  6561,  227814,  1004220,   1272264,    623280,   132384,    12096,     384;
  8: 19683, 1152192,  7485168,  13458816,   9400608,  2967552,   446208,   30720,   768;
  9: 59049, 5800326, 54700560, 136099680, 130324320, 57379392, 12628224, 1414656, 76032, 1536;
%F Formula
The row polynomials satisfy P(n,x) = (3+2*x)*P(n-1,x) + 2*x*d/dx P(n-1,x) for n >= 1, with P(0,x) = 3.
%t Mathematica
P[0, x_] := 3;
P[n_, x_] := P[n, x] = Expand[(3 + 2*x)*P[n - 1, x] + 2*x*D[P[n - 1, x], x]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten
%o PARI/GP
P(N) = {my(v = vector(N + 1)); v[1] = 3; for(n = 1, N, my(i = n + 1); v[i] = (3 + 2*x)*v[i - 1] + 2*x*deriv(v[i - 1], x)); 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)

Generated with polytool c48629374597.

Proved properties

  • Real-rooted. Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
    Every polynomial of the sequence has only real roots, inside the stated interval.
    by the cited steps: e-1fc5789fa458cf8e
  • Coefficients of one sign. Every nonzero row, n >= 0: the coefficients of P_n have one sign
    All coefficients of each polynomial have the same sign (after x -> -x when alternating).
    derived from the cited steps by a stated theorem: e-1fc5789fa458cf8e
  • Hadamard kernel (Malo). Rows P_n, n >= 0, are Hadamard kernels (preserve real-rootedness)
    Multiplying the coefficients of any real-rooted polynomial termwise by those of a row (Hadamard product) gives a real-rooted polynomial again.
    derived from the cited steps by a stated theorem: e-1fc5789fa458cf8e

Proof chains

1 incoming proof step. Each step is expanded back to the roots of the proof DAG, the theorem checks of a node's own rule. JSON

Same fingerprint (1)

Equal up to content, sign, reversal and a small index shift.

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