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

Rows ?

nx0x1x2x3x4x5x6x7x8x9x10x11x12x13x14Pn(1)
111
2437
31625546
464175777323
5256113785517492431
610247095821728273301119504
74096432257283937726739755913165855
81638425942361398544931513093016548875151487475
96553615419855005599497416620145173752583308212921714011452
102621449107175398781695237967528268466724126193537060762182419138134865
111048576535598173125258155322156143719239091254283172211513520958241044542485211421019967
124194304314086735242022980952672926754668686786201201686246310313759576693431719217026932892315213677774
1316777216183830062518578180655511072569505657000912530490370920888590366014829663001452596758307475265705425025169123602581
146710886410745077143141674672745488408060955667064356290442419315831159682615200335135851204238072280326523054151106673997895382271948154903347
152684354566274960274510750431345354612735438590770013927208562055025221392727903853857703937295360111361598480110343654986860299162621431858321966992923211388352926

Computed in your browser ?

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

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 -1)
  • 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 = 1, …, ascending powers of x
%e Example
Triangle begins:
   1:      1;
   2:      4,       3;
   3:     16,      25,        5;
   4:     64,     175,       77,        7;
   5:    256,    1137,      855,      174,        9;
   6:   1024,    7095,     8217,     2827,      330,      11;
   7:   4096,   43225,    72839,    37726,     7397,     559,     13;
   8:  16384,  259423,   613985,   449315,   130930,   16548,    875,    15;
   9:  65536, 1541985,  5005599,  4974166,  2014517,  375258,  33082,  1292,   17;
  10: 262144, 9107175, 39878169, 52379675, 28268466, 7241261, 935370, 60762, 1824, 19;
%F Formula
The row polynomials satisfy P(n,x) = -(x+x^2)*P(n-2,x) - (x+2*x^2)*d/dx P(n-2,x) - x^2*d^2/dx^2 P(n-2,x) + (4+2*x)*P(n-1,x) + 2*x*d/dx P(n-1,x) for n >= 3, with P(1,x) = 1, P(2,x) = 4 + 3*x.
%t Mathematica
P[1, x_] := 1;
P[2, x_] := 4 + 3*x;
P[n_, x_] := P[n, x] = Expand[-(x + x^2)*P[n - 2, x] - (x + 2*x^2)*D[P[n - 2, x], x] - x^2*D[P[n - 2, x], {x, 2}] + (4 + 2*x)*P[n - 1, x] + 2*x*D[P[n - 1, x], x]];
Table[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten
%o PARI/GP
P(N) = {my(v = vector(N)); v[1] = 1; v[2] = 4 + 3*x; for(n = 3, N, my(i = n); v[i] = -(x + x^2)*v[i - 2] - (x + 2*x^2)*deriv(v[i - 2], x) - x^2*deriv(deriv(v[i - 2], x), x) + (4 + 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, v[i])))};
T(10)

Generated with polytool c48629374597.

Proved properties

  • Real-rooted. Every row P_n, n >= 1, 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-ac43a5abaccfbd29
  • Coefficients of one sign. Every nonzero row, n >= 1: 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-ac43a5abaccfbd29
  • Hadamard kernel (Malo). Rows P_n, n >= 1, 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-ac43a5abaccfbd29

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. [Fav35] Jean Favard. Sur les polynômes de tchebicheff. C. R. Acad. Sci. Paris, 200:2052–2053, 1935.
  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
  3. [Sze39] G. Szegő. Orthogonal Polynomials. Colloquium publications, American Mathematical Society, 1939. doi:10.1090/coll/023