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

Rows ?

nx0x1x2x3x4x5x6x7Pn(1)
011
1213
21011122
34083251149
42307693934511438
5130068635659122772115122
6904071393840432783830591071195481
7648807641551265805603645103324661615112808577

Computed in your browser ?

Technical details
Node id
n-f31ac0aa03765fb6 · revision 1 · JSON
Definition source
derived:basis_map_A008277
Fingerprint
f6-f8dd164ad5488c6f

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:       1;
  1:       2,         1;
  2:      10,        11,         1;
  3:      40,        83,        25,         1;
  4:     230,       769,       393,        45,        1;
  5:    1300,      6863,      5659,      1227,       72,        1;
  6:    9040,     71393,     84043,     27838,     3059,      107,      1;
  7:   64880,    764155,   1265805,    603645,   103324,     6616,    151,     1;
  8:  536560,   9189515,  20385865,  13076805,  3164574,   316181,  12954,   205,   1;
  9: 4641520, 115730555, 341619325, 288191065, 93678824, 13243941, 841828, 23544, 270, 1;
%F Formula
The row polynomials satisfy P(n,x) = ((1/2)*n^2+(3/2)*n+1+((1/2)*n^2+(3/2)*n+1)*x)*P(n-2,x) + ((1/2)*n^2+(3/2)*n+1)*x*d/dx P(n-2,x) + (2+x)*P(n-1,x) + x*d/dx P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 2 + x.
%t Mathematica
P[0, x_] := 1;
P[1, x_] := 2 + x;
P[n_, x_] := P[n, x] = Expand[((1/2)*n^2 + (3/2)*n + 1 + ((1/2)*n^2 + (3/2)*n + 1)*x)*P[n - 2, x] + ((1/2)*n^2 + (3/2)*n + 1)*x*D[P[n - 2, x], x] + (2 + x)*P[n - 1, x] + 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; v[2] = 2 + x; for(n = 2, N, my(i = n + 1); v[i] = ((1/2)*n^2 + (3/2)*n + 1 + ((1/2)*n^2 + (3/2)*n + 1)*x)*v[i - 2] + ((1/2)*n^2 + (3/2)*n + 1)*x*deriv(v[i - 2], x) + (2 + x)*v[i - 1] + 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-d61a33ddedddac02
  • 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-d61a33ddedddac02
  • 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-d61a33ddedddac02

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

No candidate equalities or related sequences.

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