A249248 → 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 + n + n x\right)\,P_{n-2}(x) + \left(x + n 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) = 4 + 3\,x\)

Rows ?

nx0x1x2x3x4x5x6x7x8x9x10x11x12x13x14Pn(1)
011
1437
21116330
33899403180
41315503847031138
549031973400104610638242
618971869828711132782277148365012
777141130632407181557733954843051963561320
8325017005402019414175599061502898168739425035229288
9142142447252117130366194374648981288195598421409011844310352346012
1064179529329096147340587213794800126467622359175725317890424020179913763559251752
112989294197675291128905487223548772511744727380626496930119916060128401747795382620744836349383448
1214321923136691499811481455920260961983582382296936110575855592253668183634870827628252761135057836900526376272747032
13704939629691825181104200497376291882341974324133212638174905883945513920411808791980648909220110576916312229268505146103966037469040
14355816769703682482909636630560553301605947526441484729524728576459439481011031640045210415087672269289286232170206166110790017353413067529700312859146562720

Computed in your browser ?

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

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:      4,       3;
  2:     11,      16,        3;
  3:     38,      99,       40,        3;
  4:    131,     550,      384,       70,       3;
  5:    490,    3197,     3400,     1046,     106,       3;
  6:   1897,   18698,    28711,    13278,    2277,     148,      3;
  7:   7714,  113063,   240718,   155773,   39548,    4305,    196,     3;
  8:  32501,  700540,  2019414,  1755990,  615028,   98168,   7394,   250,   3;
  9: 142142, 4472521, 17130366, 19437464, 8981288, 1955984, 214090, 11844, 310, 3;
%F Formula
The row polynomials satisfy P(n,x) = (n+1+(n+1)*x)*P(n-2,x) + (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) = 4 + 3*x.
%t Mathematica
P[0, x_] := 1;
P[1, x_] := 4 + 3*x;
P[n_, x_] := P[n, x] = Expand[(n + 1 + (n + 1)*x)*P[n - 2, x] + (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] = 4 + 3*x; for(n = 2, N, my(i = n + 1); v[i] = (n + 1 + (n + 1)*x)*v[i - 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-b777d60665436f83
  • 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-b777d60665436f83
  • 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-b777d60665436f83

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