A054142 → 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) = 2 + x\)

Rows ?

nx0x1x2x3x4x5x6x7x8x9x10x11x12x13x14Pn(1)
011
1213
256112
3133012156
434137100201292
5895947032503011667
623324984490249952542110288
7610103132704021956707098056168026
815974209415677317777281576170941680721478659
9418117058288606413626058514862503683683427009013564911
101094668810549205881005171682954353267264667128726664125110127978084
112865727675462698865972131910769165583932310310630312159390013368360501321230520511
127502511109786146718942507204831687574051446110450154641747304321163491202232375858015611987599262
1319641844542825792487848351248264459786344244840738196210284492052584208378642135712340238538511830182117883932293
145142291784427424260406153240438998165088903025650756369804271596946888431613172159110965018687325813701402614341159252101167512285647

Computed in your browser ?

Technical details
Node id
n-78db5665b18c691b · revision 1 · JSON
Definition source
derived:basis_map_A008277
Fingerprint
f6-e5461fde6b0fcf98

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:    5,      6,      1;
  3:   13,     30,     12,       1;
  4:   34,    137,    100,      20,      1;
  5:   89,    594,    703,     250,     30,      1;
  6:  233,   2498,   4490,    2499,    525,     42,     1;
  7:  610,  10313,  27040,   21956,   7070,    980,    56,    1;
  8: 1597,  42094, 156773,  177772,  81576,  17094,  1680,   72,  1;
  9: 4181, 170582, 886064, 1362605, 851486, 250368, 36834, 2700, 90, 1;
%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) = 2 + x.
%t Mathematica
P[0, x_] := 1;
P[1, x_] := 2 + 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] = 2 + 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-2066319958628df3
  • 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-2066319958628df3
  • 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-2066319958628df3

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