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

Rows ?

nx0x1x2x3x4x5x6x7x8x9x10x11x12x13x14Pn(1)
011
1224
2412420
3856488120
41624040016016832
53299228802080480326496
66440321926422400896013446456128
712816256123648217728134400340483584128529920
8256652807744001989120177945667737611827292162565413632
9512261632477696017461760217728001168742430105603840002304051259379200
10102410475522918502414924800025265152018379468865522688121651201182720563201024694855680
1120484192256177205248125235404828250112002710839296128490700832568729645619200349184013516820488629446656
124096167731201071616000103732428803075482009638180093952234103767047780810752147252019216107520099573763194884096113231613952
138192671006726463242240851291750403282946867205196707676164041054617601713137254404206698496061665443845412126722758246474547281921563847245824
141638426841907238913654784693959884800345320521728068926385848326696817999872354923053056010998331801602074648576002423976755217444044807454720017203201638422658392801280

Computed in your browser ?

Technical details
Node id
n-95ac664928981c03 · revision 1 · JSON
Definition source
derived:basis_map_A008277
Fingerprint
f6-4732d0911d5a78c5

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 ?

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:   1;
  1:   2,      2;
  2:   4,     12,       4;
  3:   8,     56,      48,        8;
  4:  16,    240,     400,      160,       16;
  5:  32,    992,    2880,     2080,      480,       32;
  6:  64,   4032,   19264,    22400,     8960,     1344,      64;
  7: 128,  16256,  123648,   217728,   134400,    34048,    3584,    128;
  8: 256,  65280,  774400,  1989120,  1779456,   677376,  118272,   9216,   256;
  9: 512, 261632, 4776960, 17461760, 21772800, 11687424, 3010560, 384000, 23040, 512;
%F Formula
The row polynomials satisfy P(n,x) = (2+2*x)*P(n-1,x) + 2*x*d/dx P(n-1,x) for n >= 1, with P(0,x) = 1.
%t Mathematica
P[0, x_] := 1;
P[n_, x_] := P[n, x] = Expand[(2 + 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] = 1; for(n = 1, N, my(i = n + 1); v[i] = (2 + 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-dbb6853ea73a13a7
  • 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-dbb6853ea73a13a7
  • 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-dbb6853ea73a13a7

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 (11)

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

References

  1. [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