Real-rooted atlas

A085881 → basis A013609

palindromic γ-positive nonnegative coefficients only rational roots

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

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

Rows ?

nx0x1x2x3x4x5x6x7Pn(1)
011
1224
212241248
3120360360120960
416806720100806720168026880
53024015120030240030240015120030240967680
666528039916809979200133056009979200399168066528042577920
717297280121080960363242880605404800605404800363242880121080960172972802214051840

Show all 15 stored rows

Generated b-files: A144828 (row sums), A164961, A164961 (reversed triangle) ?

Computed in your browser ?

Technical details
Node id
n-1a3a6cbc48d40fe3 · revision 1 · JSON
Definition source
derived:basis_map_A013609
Fingerprint
f6-77a7ed3b1d5f257e

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: yes
  • γ-positive (gamma_positive): yes
  • Nonnegative coefficients (nonn): yes
  • Only rational roots (rr_by_factors: every nonzero row is a product of linear factors over ℚ): yes

OEIS matches ?

A generated b-file is computed from the node's definition along the row alignment of its OEIS link and starts at the entry's offset. It is an identification on a finite prefix, not a proof that the node and the OEIS entry agree for every n.

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,            2;
  2:          12,           24,           12;
  3:         120,          360,          360,           120;
  4:        1680,         6720,        10080,          6720,          1680;
  5:       30240,       151200,       302400,        302400,        151200,         30240;
  6:      665280,      3991680,      9979200,      13305600,       9979200,       3991680,        665280;
  7:    17297280,    121080960,    363242880,     605404800,     605404800,     363242880,     121080960,     17297280;
  8:   518918400,   4151347200,  14529715200,   29059430400,   36324288000,   29059430400,   14529715200,   4151347200,    518918400;
  9: 17643225600, 158789030400, 635156121600, 1482030950400, 2223046425600, 2223046425600, 1482030950400, 635156121600, 158789030400, 17643225600;
%F Formula
The row polynomials satisfy P(n,x) = (4*n-2+(4*n-2)*x)*P(n-1,x) for n >= 1, with P(0,x) = 1.
%t Mathematica
P[0, x_] := 1;
P[n_, x_] := P[n, x] = Expand[(4*n - 2 + (4*n - 2)*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] = 1; for(n = 1, N, my(i = n + 1); v[i] = (4*n - 2 + (4*n - 2)*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.

A164961: triangle, offset 0, from the row P0
%e Example
Triangle begins:
  0:           1;
  1:           2,            2;
  2:          12,           24,           12;
  3:         120,          360,          360,           120;
  4:        1680,         6720,        10080,          6720,          1680;
  5:       30240,       151200,       302400,        302400,        151200,         30240;
  6:      665280,      3991680,      9979200,      13305600,       9979200,       3991680,        665280;
  7:    17297280,    121080960,    363242880,     605404800,     605404800,     363242880,     121080960,     17297280;
  8:   518918400,   4151347200,  14529715200,   29059430400,   36324288000,   29059430400,   14529715200,   4151347200,    518918400;
  9: 17643225600, 158789030400, 635156121600, 1482030950400, 2223046425600, 2223046425600, 1482030950400, 635156121600, 158789030400, 17643225600;
%F Formula
The row polynomials satisfy P(n,x) = (4*n-2+(4*n-2)*x)*P(n-1,x) for n >= 1, with P(0,x) = 1.
%t Mathematica
P[0, x_] := 1;
P[n_, x_] := P[n, x] = Expand[(4*n - 2 + (4*n - 2)*x)*P[n - 1, x]];
Table[PadRight[CoefficientList[P[n, x], x], n + 1], {n, 0, 9}] // Flatten
%o PARI/GP
P(N) = {my(v = vector(N + 1)); v[1] = 1; for(n = 1, N, my(i = n + 1); v[i] = (4*n - 2 + (4*n - 2)*x)*v[i - 1]); v};
row(n, p) = {my(c = Vecrev(p)); c = concat(c, vector(n + 1 - #c)); c};
T(N) = {my(v = P(N)); concat(vector(#v, i, row(i - 1, v[i])))};
T(9)

Generated with polytool c48629374597.

A164961: reversed triangle, offset 0, from the row P0
%e Example
Triangle begins:
  0:           1;
  1:           2,            2;
  2:          12,           24,           12;
  3:         120,          360,          360,           120;
  4:        1680,         6720,        10080,          6720,          1680;
  5:       30240,       151200,       302400,        302400,        151200,         30240;
  6:      665280,      3991680,      9979200,      13305600,       9979200,       3991680,        665280;
  7:    17297280,    121080960,    363242880,     605404800,     605404800,     363242880,     121080960,     17297280;
  8:   518918400,   4151347200,  14529715200,   29059430400,   36324288000,   29059430400,   14529715200,   4151347200,    518918400;
  9: 17643225600, 158789030400, 635156121600, 1482030950400, 2223046425600, 2223046425600, 1482030950400, 635156121600, 158789030400, 17643225600;
%F Formula
Row n lists the coefficients of P(n,x) in descending powers of x, where P(n,x) = (4*n-2+(4*n-2)*x)*P(n-1,x) for n >= 1, with P(0,x) = 1.
%t Mathematica
P[0, x_] := 1;
P[n_, x_] := P[n, x] = Expand[(4*n - 2 + (4*n - 2)*x)*P[n - 1, x]];
Table[Reverse[PadRight[CoefficientList[P[n, x], x], n + 1]], {n, 0, 9}] // Flatten
%o PARI/GP
P(N) = {my(v = vector(N + 1)); v[1] = 1; for(n = 1, N, my(i = n + 1); v[i] = (4*n - 2 + (4*n - 2)*x)*v[i - 1]); v};
row(n, p) = {my(c = Vecrev(p)); c = concat(c, vector(n + 1 - #c)); c = Vecrev(c); 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-0f3734a094503340
  • 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-0f3734a094503340
  • 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-0f3734a094503340

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 (59)

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