A344565 → basis A013610

nonnegative coefficients only rational roots

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

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

Rows ?

nx0x1x2x3x4x5x6x7x8x9x10x11x12x13x14Pn(1)
033
1304575
21805404051125
384037805670283513125
4336020160453604536017010131250
51209690720272160408240306180918541181250
64032036288013608002721600306180018370804592709843750
71267201330560598752014968800224532002020788010103940216513077343750
838016045619202395008071850240134719200161663040121247280519631209743085580078125
91098240148262408895744031135104070053984010508097601050809760675520560253320210422200354189453125
10307507246126080311351040124540416032691859205884534656735566832063048585603546482940118216098017732414729326171875
118386560138378240103783680046702656001401079680029422673280441340099204728643920035464829400177324147005319724410725416965199951171875
122236416040255488033210777601660538880056043187200134503649280235381386240302633210880283718635200189145756800851155905602321334288029016678601333007812500
135849088011405721601026514944056458321920211718707200571640509440114328101888017149215283201929286719360160773893280096464335968039462682896098656707240113834662208715820312500
1415040512031585075203079544832018477268992076218734592022865620377605144764584960881959643136011575720316160115757203161608681790237120473552194752017758207303204098047839204390765542056030273437500

Computed in your browser ?

Technical details
Node id
n-936114cbd4070c9a · revision 1 · JSON
Definition source
derived:basis_map_A013610
Fingerprint
f6-f06e51c139cfae05

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,       45;
  2:     180,      540,      405;
  3:     840,     3780,     5670,      2835;
  4:    3360,    20160,    45360,     45360,     17010;
  5:   12096,    90720,   272160,    408240,    306180,      91854;
  6:   40320,   362880,  1360800,   2721600,   3061800,    1837080,     459270;
  7:  126720,  1330560,  5987520,  14968800,  22453200,   20207880,   10103940,   2165130;
  8:  380160,  4561920, 23950080,  71850240, 134719200,  161663040,  121247280,  51963120,   9743085;
  9: 1098240, 14826240, 88957440, 311351040, 700539840, 1050809760, 1050809760, 675520560, 253320210, 42220035;
%F Formula
The row polynomials satisfy n*P(n,x) = (2*n+8+(3*n+12)*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 + (3*n + 12)*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 + (3*n + 12)*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-127cb25e0d856e7f
  • 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-127cb25e0d856e7f
  • 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-127cb25e0d856e7f
  • 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-127cb25e0d856e7f

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

Same fingerprint (23)

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