A013610 → θ+1

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

Rows ?

nx0x1x2x3x4x5x6x7x8x9x10x11x12x13x14Pn(1)
011
1167
21122740
311881108208
41241624324051024
51302701080202514584864
6136405216060758748510322528
7142567378014175306183572117496102400
81487566048283508164814288413996859049458752
91549729072510301837084286526298565314411968302031616
101601215129608505036741610716302099520265720519683006495398912896
11166148517820133650673596235758657736809743085108256507144929212576438797312
121721782237602004751154736471517213856832292292554330260042869574255091686908733167772160
131782106308882895751876446875674830023136759960631407334501857681541658095928981352922320522721420288
1418424573931240540529189161532430960046272177324147394053660650188539773778096628694703312487308717445353087007744

Generated b-files: A081039 (row sums) ?

Computed in your browser ?

Technical details
Node id
n-5d76cb5fbd68dd8d · revision 1 · JSON
Definition source
derived:theta_plus_one
Fingerprint
f6-3151c955f16eaf46

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: 1,  6;
  2: 1, 12,  27;
  3: 1, 18,  81,  108;
  4: 1, 24, 162,  432,   405;
  5: 1, 30, 270, 1080,  2025,   1458;
  6: 1, 36, 405, 2160,  6075,   8748,   5103;
  7: 1, 42, 567, 3780, 14175,  30618,  35721,  17496;
  8: 1, 48, 756, 6048, 28350,  81648, 142884, 139968,  59049;
  9: 1, 54, 972, 9072, 51030, 183708, 428652, 629856, 531441, 196830;
%F Formula
The row polynomials satisfy (1+3*n*x)*P(n,x) = (1+(3*n+6)*x+(9*n+9)*x^2)*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[((1 + (3*n + 6)*x + (9*n + 9)*x^2)*P[n - 1, x])/(1 + 3*n*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] = ((1 + (3*n + 6)*x + (9*n + 9)*x^2)*v[i - 1])/(1 + 3*n*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 (-inf, 0]
    Every polynomial of the sequence has only real roots, inside the stated interval.
    by the cited steps: e-f9e2d8425abfb1aa
  • 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-f9e2d8425abfb1aa
  • 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-f9e2d8425abfb1aa
  • 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-f9e2d8425abfb1aa

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.

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.