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

Rows ?

nx0x1x2x3x4x5x6x7x8x9x10x11x12x13x14Pn(1)
011
1437
21120536
32998567190
47643543212091072
5199184828711342220116491
65217670176541244133673641342030
713643140310364010386041470730856015289620
8357112750059052981171645009211536214280816172113883
9934951493832975646067859449931415767722810102576411401916273729
1024476207267518156992439572004247989919580904471917661822243659154021131654764
116407983245289898217931124515438480214422718744571182608125073081254627703342024231115622453
12167761333866705357235302166683925337954462525068924409938427352250547003008720023845251086802600259873879416
13439204133778523288431172014890480140289881165602662587421213095239184371822109363633456966870804429214516216232762791044123619
14114985153572106015469126205101332550520244125747960274522795236165012895824575822026841226996316216417920221391484387379775234871406029872640711697

Computed in your browser ?

Technical details
Node id
n-1d57286bb11fcda7 · revision 1 · JSON
Definition source
derived:basis_map_A008277
Fingerprint
f6-74fa66db2bf1cc10

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,     20,       5;
  3:   29,     98,      56,       7;
  4:   76,    435,     432,     120,       9;
  5:  199,   1848,    2871,    1342,     220,      11;
  6:  521,   7670,   17654,   12441,    3367,     364,     13;
  7: 1364,  31403,  103640,  103860,   41470,    7308,    560,    15;
  8: 3571, 127500,  590529,  811716,  450092,  115362,  14280,   816,   17;
  9: 9349, 514938, 3297564, 6067859, 4499314, 1576772, 281010, 25764, 1140, 19;
%F Formula
The row polynomials satisfy P(n,x) = -(1+3*x+x^2)*P(n-2,x) - (3*x+2*x^2)*d/dx P(n-2,x) - x^2*d^2/dx^2 P(n-2,x) + (3+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 + 3*x.
%t Mathematica
P[0, x_] := 1;
P[1, x_] := 4 + 3*x;
P[n_, x_] := P[n, x] = Expand[-(1 + 3*x + x^2)*P[n - 2, x] - (3*x + 2*x^2)*D[P[n - 2, x], x] - x^2*D[P[n - 2, x], {x, 2}] + (3 + 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 + 3*x; for(n = 2, N, my(i = n + 1); v[i] = -(1 + 3*x + x^2)*v[i - 2] - (3*x + 2*x^2)*deriv(v[i - 2], x) - x^2*deriv(deriv(v[i - 2], x), x) + (3 + 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-33df605750c1b89e
  • 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-33df605750c1b89e
  • 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-33df605750c1b89e

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