A091044 → 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_{0}(x) = 1\)
\(P_{1}(x) = 4 + 2\,x\)

Rows ?

nx0x1x2x3x4x5x6x7x8x9x10x11x12x13x14Pn(1)
011
1426
21619338
364140524260
425693361111051915
51024590660621886200615084
6409636295548092600647113297126253
716384219032468072316488860801019250481116760
865536130656938504233556630135370923821819866732910391692
92621447735070308707543785936219297000469646257795635772102010101335550
1010485764556260324304923738776677425687654782649007139509371267464605221375111032233053
11419430426747555618885687323860943116325341382413418952802967485083675350825655529737218041210952657568
12167772161566630765145335676353763585887039695410713205274806965763517332928943236879817514865575150293231413120761186409
1367108864916166916211104090671036096691671047064685456830008650163810457403051221247465136260527503619475112887421622240422912141380600448594
142684354565352082471984379965195334187937817505456584937103423442315938118003731691474506310088966927193305666763303104038571681500769432423336051516334762424486

Computed in your browser ?

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

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,       2;
  2:     16,      19,        3;
  3:     64,     140,       52,        4;
  4:    256,     933,      611,      110,        5;
  5:   1024,    5906,     6062,     1886,      200,       6;
  6:   4096,   36295,    54809,    26006,     4711,     329,      7;
  7:  16384,  219032,   468072,   316488,    86080,   10192,    504,     8;
  8:  65536, 1306569,  3850423,  3556630,  1353709,  238218,  19866,   732,    9;
  9: 262144, 7735070, 30870754, 37859362, 19297000, 4696462, 577956, 35772, 1020, 10;
%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 >= 2, with P(0,x) = 1, P(1,x) = 4 + 2*x.
%t Mathematica
P[0, x_] := 1;
P[1, x_] := 4 + 2*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, 0, 9}] // Flatten
%o PARI/GP
P(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = 4 + 2*x; for(n = 2, N, my(i = n + 1); 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 - 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-5527b97fbf649c70
  • 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-5527b97fbf649c70
  • 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-5527b97fbf649c70

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