A007318 → D+1 → 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(4 + 11\,x + 9\,x^{2} + 2\,x^{3} - 2\,n - 6\,n x - 6\,n x^{2} - 2\,n x^{3}\right)\,P_{n-1}(x) + \left(1 + 5\,x + 9\,x^{2} + 7\,x^{3} + 2\,x^{4}\right)\,P_{n-1}'(x)\)
\(P_{0}(x) = 1\)

Rows ?

nx0x1x2x3x4x5x6x7x8x9x10x11x12x13x14Pn(1)
011
1235
2310821
3421362081
45369611248297
56552003603201121053
677836088012008642563645
78105588182033603696224057612393
891368963360784011648107525632128041553
9101711296571216128302403763229952138242816137781
101121018009120302406854410752011520080640332806144452709
11122532420138605280014044826611235904033792021120078848133121476225
1213300316820240871202661125913609630721140480957440540672184320286724782969
13143514056286001372804736161208064230630432947203477760263577613578244259846144015411789
141540650963931220820880080023063045051904845644810762752102502407081984335462497484813107249424013

Generated b-files: A081038 (row sums) ?

Computed in your browser ?

Technical details
Node id
n-63f4fccd6debb0ee · revision 1 · JSON
Definition source
derived:mobius_x_over_x_plus_one
Fingerprint
f6-48023a6581f41e60

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 ?

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,   3;
  2:  3,  10,    8;
  3:  4,  21,   36,   20;
  4:  5,  36,   96,  112,    48;
  5:  6,  55,  200,  360,   320,   112;
  6:  7,  78,  360,  880,  1200,   864,   256;
  7:  8, 105,  588, 1820,  3360,  3696,  2240,   576;
  8:  9, 136,  896, 3360,  7840, 11648, 10752,  5632,  1280;
  9: 10, 171, 1296, 5712, 16128, 30240, 37632, 29952, 13824, 2816;
%F Formula
The row polynomials satisfy (1+x)*P(n,x) = -(2*n-4+(6*n-11)*x+(6*n-9)*x^2+(2*n-2)*x^3)*P(n-1,x) + (1+5*x+9*x^2+7*x^3+2*x^4)*d/dx 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[Together[(-(2*n - 4 + (6*n - 11)*x + (6*n - 9)*x^2 + (2*n - 2)*x^3)*P[n - 1, x] + (1 + 5*x + 9*x^2 + 7*x^3 + 2*x^4)*D[P[n - 1, x], 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; for(n = 1, N, my(i = n + 1); v[i] = (-(2*n - 4 + (6*n - 11)*x + (6*n - 9)*x^2 + (2*n - 2)*x^3)*v[i - 1] + (1 + 5*x + 9*x^2 + 7*x^3 + 2*x^4)*deriv(v[i - 1], x))/(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-b1f54f3013fcb96b
  • 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-b1f54f3013fcb96b
  • 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-b1f54f3013fcb96b

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

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

References

  1. [ASW52] Michael Aissen, I. J. Schoenberg and A. M. Whitney. On the generating functions of totally positive sequences I. Journal d’Analyse Mathématique, 2(1):93–103, 1952. doi:10.1007/BF02786970
  2. [AW24] Christos A. Athanasiadis and David G. Wagner. Veronese sections and interlacing matrices of polynomials and formal power series. arXiv:2404.12989. arXiv
  3. [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
  4. [Edr53] Albert Edrei. Proof of a Conjecture of Schoenberg on the Generating Function of a Totally Positive Sequence. Canadian Journal of Mathematics, 5:86–94, 1953. doi:10.4153/CJM-1953-010-3
  5. [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
  6. [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.