Real-rooted atlas

A122431 → x ↦ x/(x+1)

nonnegative coefficients only rational roots

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

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

Rows ?

nx0x1x2x3x4x5x6x7x8x9x10Pn(1)
01612827
101612827
2001612827
30001612827
400001612827
5000001612827
60000001612827
700000001612827

Show all 15 stored rows

Computed in your browser ?

Technical details
Node id
n-7f9ce95b8e46d30e · revision 1 · JSON
Definition source
derived:mobius_x_over_x_plus_one
Fingerprint
f6-4aa2b326ecc8d8d2

Observed on the stored rows ?

  • Degrees: 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17 (affine: slope 1, intercept 3)
  • 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: 1, 6, 12,  8;
  1: 0, 1,  6, 12,  8;
  2: 0, 0,  1,  6, 12,  8;
  3: 0, 0,  0,  1,  6, 12,  8;
  4: 0, 0,  0,  0,  1,  6, 12,  8;
  5: 0, 0,  0,  0,  0,  1,  6, 12,  8;
  6: 0, 0,  0,  0,  0,  0,  1,  6, 12,  8;
  7: 0, 0,  0,  0,  0,  0,  0,  1,  6, 12,  8;
  8: 0, 0,  0,  0,  0,  0,  0,  0,  1,  6, 12,  8;
  9: 0, 0,  0,  0,  0,  0,  0,  0,  0,  1,  6, 12, 8;
%F Formula
The row polynomials satisfy (1+x)*P(n,x) = (x+x^2)*P(n-1,x) for n >= 1, with P(0,x) = 1 + 6*x + 12*x^2 + 8*x^3.
%t Mathematica
P[0, x_] := 1 + 6*x + 12*x^2 + 8*x^3;
P[n_, x_] := P[n, x] = Expand[Together[((x + x^2)*P[n - 1, x])/(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 + 6*x + 12*x^2 + 8*x^3; for(n = 1, N, my(i = n + 1); v[i] = ((x + x^2)*v[i - 1])/(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 [-1, 0]
    Every polynomial of the sequence has only real roots, inside the stated interval.
    by the cited steps: e-112d4d02aeda07ce
  • 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-112d4d02aeda07ce
  • 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-112d4d02aeda07ce

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.