A344565 → basis A007318

nonnegative coefficients only rational roots

Proved for all n: all roots real, in (−∞, −1] · coefficients of one sign · interlacing (weak) · Hadamard kernel what this means

Recurrence
\(\left(n\right)\,P_{n}(x) = \left(8 + 4\,x + 2\,n + n x\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 3\)

Rows ?

nx0x1x2x3x4x5x6x7Pn(1)
033
1301545
218018045405
384012606301052835
4336067205040168021017010
512096302403024015120378037891854
640320120960151200100800378007560630459270
712672044352066528055440027720083160138609902165130

Computed in your browser ?

Technical details
Node id
n-e93f0e54dbc33ad5 · revision 2 · JSON
Definition source
derived:basis_map_A007318
Fingerprint
f6-11aec07ce60b6d61

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 ℚ): yes

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:       3;
  1:      30,      15;
  2:     180,     180,      45;
  3:     840,    1260,     630,      105;
  4:    3360,    6720,    5040,     1680,     210;
  5:   12096,   30240,   30240,    15120,    3780,     378;
  6:   40320,  120960,  151200,   100800,   37800,    7560,     630;
  7:  126720,  443520,  665280,   554400,  277200,   83160,   13860,    990;
  8:  380160, 1520640, 2661120,  2661120, 1663200,  665280,  166320,  23760,  1485;
  9: 1098240, 4942080, 9884160, 11531520, 8648640, 4324320, 1441440, 308880, 38610, 2145;
%F Formula
The row polynomials satisfy n*P(n,x) = (2*n+8+(n+4)*x)*P(n-1,x) for n >= 1, with P(0,x) = 3.
%t Mathematica
P[0, x_] := 3;
P[n_, x_] := P[n, x] = Expand[Together[((2*n + 8 + (n + 4)*x)*P[n - 1, x])/(n)]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten
%o PARI/GP
P(N) = {my(v = vector(N + 1)); v[1] = 3; for(n = 1, N, my(i = n + 1); v[i] = ((2*n + 8 + (n + 4)*x)*v[i - 1])/(n)); 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-5d53734a383a65e0
  • 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-5d53734a383a65e0, e-ecb3a914f88de7f3
  • 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-5d53734a383a65e0, e-ecb3a914f88de7f3
  • Interlacing of consecutive rows. Rows P_(m-1), P_m interlace (weak, unordered) for every m >= 1
    The roots of consecutive polynomials alternate on the real line.
    by the cited steps: e-5d53734a383a65e0, e-ecb3a914f88de7f3
  • Real-rooted. Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, -1]
    Every polynomial of the sequence has only real roots, inside the stated interval.
    by the cited steps: e-ecb3a914f88de7f3

Proof chains

2 incoming proof steps. Each step is expanded back to the roots of the proof DAG, the theorem checks of a node's own rule. JSON

Same fingerprint (67)

Equal up to content, sign, reversal and a small index shift.

References

  1. [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