A008277 → θ+2 (shift +1) → θ+1

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

Rows ?

nx0x1x2x3x4x5x6x7x8x9x10x11x12x13x14Pn(1)
022
1268
22181232
32427220136
429030020030622
5218610801300450423060
623783612700042008825616130
727621159234020315001117215687290688
8215303630015540020853011113225872259290541448
92306611196068210012757509587343292805400040501103419052
10261383420122915000740190075384543583272855360103950605013222752270
112122821038312122300204138200055593384351341761144994420047501875508712156159041288
12224570313950050650600225255030391495104320063744136772064323551804325750320892121681821164414786
1324914694676402078349001202251050266432766627624396801505687040462161700828027208720712525252165622108906284280
1429829828501212847119000632300760017669117466228895146481559720448060415641001392891500195291096166093208281002205024071001769112

Computed in your browser ?

Technical details
Node id
n-491402ace602b8ce · revision 1 · JSON
Definition source
derived:theta_plus_one
Fingerprint
f6-df87a7a77830807f

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: 2;
  1: 2,    6;
  2: 2,   18,     12;
  3: 2,   42,     72,     20;
  4: 2,   90,    300,    200,      30;
  5: 2,  186,   1080,   1300,     450,     42;
  6: 2,  378,   3612,   7000,    4200,    882,     56;
  7: 2,  762,  11592,  34020,   31500,  11172,   1568,    72;
  8: 2, 1530,  36300, 155400,  208530, 111132,  25872,  2592,   90;
  9: 2, 3066, 111960, 682100, 1275750, 958734, 329280, 54000, 4050, 110;
%F Formula
The row polynomials satisfy P(n,x) = (3*x-6*x^2+x^3)*P(n-3,x) + (2*x-3*x^2)*d/dx P(n-3,x) + (x^2-x^3)*d^2/dx^2 P(n-3,x) + (1+6*x-3*x^2)*P(n-2,x) + 2*x*d/dx P(n-2,x) + x^2*d^2/dx^2 P(n-2,x) + 3*x*P(n-1,x) for n >= 3, with P(0,x) = 2, P(1,x) = 2 + 6*x, P(2,x) = 2 + 18*x + 12*x^2.
%t Mathematica
P[0, x_] := 2;
P[1, x_] := 2 + 6*x;
P[2, x_] := 2 + 18*x + 12*x^2;
P[n_, x_] := P[n, x] = Expand[(3*x - 6*x^2 + x^3)*P[n - 3, x] + (2*x - 3*x^2)*D[P[n - 3, x], x] + (x^2 - x^3)*D[P[n - 3, x], {x, 2}] + (1 + 6*x - 3*x^2)*P[n - 2, x] + 2*x*D[P[n - 2, x], x] + x^2*D[P[n - 2, x], {x, 2}] + 3*x*P[n - 1, x]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten
%o PARI/GP
P(N) = {my(v = vector(N + 1)); v[1] = 2; v[2] = 2 + 6*x; v[3] = 2 + 18*x + 12*x^2; for(n = 3, N, my(i = n + 1); v[i] = (3*x - 6*x^2 + x^3)*v[i - 3] + (2*x - 3*x^2)*deriv(v[i - 3], x) + (x^2 - x^3)*deriv(deriv(v[i - 3], x), x) + (1 + 6*x - 3*x^2)*v[i - 2] + 2*x*deriv(v[i - 2], x) + x^2*deriv(deriv(v[i - 2], x), x) + 3*x*v[i - 1]); 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-d901b9327c026219
  • 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-d901b9327c026219
  • 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-d901b9327c026219

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. [Bra15] Petter Brändén. Unimodality, log-concavity, real-rootedness and beyond. Handbook of enumerative combinatorics, :437–483, March 2015. doi:10.1201/b18255-10
  2. [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
  3. [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
  4. [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.