A007318 → D → (θ+1)²
nonnegative coefficients
Proved for all n: all roots real, in (−∞, 0] · coefficients of one sign · Hadamard kernel what this means
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | Pn(1) |
|---|---|---|---|---|---|---|---|---|
| 0 | 0 | |||||||
| 1 | 1 | 1 | ||||||
| 2 | 2 | 8 | 10 | |||||
| 3 | 3 | 24 | 27 | 54 | ||||
| 4 | 4 | 48 | 108 | 64 | 224 | |||
| 5 | 5 | 80 | 270 | 320 | 125 | 800 | ||
| 6 | 6 | 120 | 540 | 960 | 750 | 216 | 2592 | |
| 7 | 7 | 168 | 945 | 2240 | 2625 | 1512 | 343 | 7840 |
Generated b-files: A058645 (row sums) ?
Computed in your browser ?
Technical details
- Node id
n-037c33706f43ad69· revision 2 · JSON- Definition source
derived:theta_plus_one_squared- Fingerprint
f6-d42e6339eab21b9c
Observed on the stored rows ?
- Degrees: -1, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13 (affine: slope 1, intercept -1)
- 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 ℚ): no
OEIS matches ?
- A058645: row sums, 15 terms agree OEIS nonn (row-sum match: finite agreement only) · view at the OEIS · generated b-file 200 terms from n = 0 ?
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 ExampleTriangle begins: 0: 0; 1: 1; 2: 2, 8; 3: 3, 24, 27; 4: 4, 48, 108, 64; 5: 5, 80, 270, 320, 125; 6: 6, 120, 540, 960, 750, 216; 7: 7, 168, 945, 2240, 2625, 1512, 343; 8: 8, 224, 1512, 4480, 7000, 6048, 2744, 512; 9: 9, 288, 2268, 8064, 15750, 18144, 12348, 4608, 729;
%F FormulaThe row polynomials satisfy (n^2-3*n+2)*P(n,x) = -(n^2-n+(4*n^2-4*n)*x-(9*n^2-9*n)*x^2)*P(n-2,x) + ((4*n^2-4*n)*x^2+(4*n^2-4*n)*x^3)*d/dx P(n-2,x) + (2*n^2-4*n+(4*n^2-8*n)*x)*P(n-1,x) - (4*n^2-8*n)*x^2*d/dx P(n-1,x) for n >= 3, with P(0,x) = 0, P(1,x) = 1, P(2,x) = 2 + 8*x.
%t MathematicaP[0, x_] := 0;
P[1, x_] := 1;
P[2, x_] := 2 + 8*x;
P[n_, x_] := P[n, x] = Expand[Together[(-(n^2 - n + (4*n^2 - 4*n)*x - (9*n^2 - 9*n)*x^2)*P[n - 2, x] + ((4*n^2 - 4*n)*x^2 + (4*n^2 - 4*n)*x^3)*D[P[n - 2, x], x] + (2*n^2 - 4*n + (4*n^2 - 8*n)*x)*P[n - 1, x] - (4*n^2 - 8*n)*x^2*D[P[n - 1, x], x])/(n^2 - 3*n + 2)]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten%o PARI/GPP(N) = {my(v = vector(N + 1)); v[1] = 0; v[2] = 1; v[3] = 2 + 8*x; for(n = 3, N, my(i = n + 1); v[i] = (-(n^2 - n + (4*n^2 - 4*n)*x - (9*n^2 - 9*n)*x^2)*v[i - 2] + ((4*n^2 - 4*n)*x^2 + (4*n^2 - 4*n)*x^3)*deriv(v[i - 2], x) + (2*n^2 - 4*n + (4*n^2 - 8*n)*x)*v[i - 1] - (4*n^2 - 8*n)*x^2*deriv(v[i - 1], x))/(n^2 - 3*n + 2)); 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-8595fb8ebe2c7ed6 -
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-8595fb8ebe2c7ed6 -
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-8595fb8ebe2c7ed6 -
Real-rooted. Every row P_n, n >= 1, 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-1e3b90e912ae07d0 -
Coefficients of one sign. Every nonzero row, n >= 1: 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-1e3b90e912ae07d0 -
Hadamard kernel (Malo). Rows P_n, n >= 1, 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-1e3b90e912ae07d0
Proof chains
2 incoming proof steps. Each step is expanded back to the roots of the proof DAG, the theorem checks of a node's own rule. JSON
-
preserver_image euler_polynomial, shift 0
e-1e3b90e912ae07d0Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 40] polytool ?
-
premise (sequence):
Triangle of denominators in Leibniz's Harmonic Triangle a(n,k), n >= 1, 1 <= k <= n.
uses: Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, 0]
-
preserver_image derivative_polynomial, shift 0
e-fd16b43297f2bb3eLaguerre’s theorem on differential operators [SP14] polytool ?
-
premise (sequence):
binomial
uses: Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, 0]
-
theorem_check liu_wang
e-317eb4ccca60c6acroot: theorem checkLiu–Wang theorem [LW07, Thm 2.1, Cor 2.4] ?
-
preserver_image reversal, shift 0
e-033cf842aad3bdf7Affine, reversal and Möbius substitutions (elementary) polytool ?
-
premise (sequence):
binomial
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
↵ theorem_check liu_wang
e-317eb4ccca60c6ac(expanded above) -
basis_map A007318
e-095baa2a9dfe188fGeometric basis map (elementary) polytool ?
-
premise (sequence):
a(n) = 1 if n is of the form m(m+3)/2, otherwise 0.
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
veronese_section r=2, j=0, shift 0
e-292206ad4ae86d2dVeronese sections of Pólya frequency sequences [ASW52; Edr53; AW24] polytool ?
-
premise (sequence):
basis-map coefficients of Irregular triangle read by rows formed by taking every other row of the Delannoy array (A0082…
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
parent_provers periodic_product
e-1991a148b9538b93root: theorem checkParent-row provers of polytool polytool ?
-
preserver_image mobius, shift 0
e-12303ad0e0b9f8ebAffine, reversal and Möbius substitutions (elementary) polytool ?
-
premise (sequence):
basis-map coefficients of Irregular triangle read by rows formed by taking every other row of the Delannoy array (A0082…
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
premise (sequence):
basis-map coefficients of Irregular triangle read by rows formed by taking every other row of the Delannoy array (A0082…
-
-
premise (sequence):
basis-map coefficients of Irregular triangle read by rows formed by taking every other row of the Delannoy array (A0082…
-
parent_provers periodic_product
e-b7eca039219a7f53root: theorem checkParent-row provers of polytool polytool ?
-
preserver_image mobius, shift 0
e-7e44b66e04c497d6Affine, reversal and Möbius substitutions (elementary) polytool ?
-
premise (sequence):
a(n) = 1 if n is of the form m(m+3)/2, otherwise 0.
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
premise (sequence):
a(n) = 1 if n is of the form m(m+3)/2, otherwise 0.
-
-
premise (sequence):
a(n) = 1 if n is of the form m(m+3)/2, otherwise 0.
-
parent_provers periodic_product
e-13983862a411779croot: theorem checkParent-row provers of polytool polytool ?
-
preserver_image reversal, shift 0
e-989c95e5c893fce9Affine, reversal and Möbius substitutions (elementary) polytool ?
-
premise (sequence):
Riordan array (1-x,x/(1-x)).
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
parent_provers periodic_product
e-b62074ba45057e82root: theorem checkParent-row provers of polytool polytool ?
-
-
premise (sequence):
Riordan array (1-x,x/(1-x)).
-
gamma_polynomial scale 1, shift 0
e-c76adc2a99cd3deaGamma criterion RealRooted IsGammaExpansion.isRealRooted_and_hasRootsNonpos_iff ?
-
premise (sequence):
Triangle read by rows, T(n,k) = GegenbauerC(m,-n,-3/2) where m = k if k<n else 2*n-k, for n>=0 and 0<=k<=2n.
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
preserver_image reversal, shift 0
e-0e058c428dfdfeb6Affine, reversal and Möbius substitutions (elementary) polytool ?
-
premise (sequence):
Triangle read by rows, T(n,k) = GegenbauerC(m,-n,-3/2) where m = k if k<n else 2*n-k, for n>=0 and 0<=k<=2n.
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
parent_provers periodic_product
e-d82c9b48e4b31a6broot: theorem checkParent-row provers of polytool polytool ?
-
-
premise (sequence):
Triangle read by rows, T(n,k) = GegenbauerC(m,-n,-3/2) where m = k if k<n else 2*n-k, for n>=0 and 0<=k<=2n.
-
↵ parent_provers periodic_product
e-d82c9b48e4b31a6b(expanded above)
-
-
premise (sequence):
Triangle read by rows, T(n,k) = GegenbauerC(m,-n,-3/2) where m = k if k<n else 2*n-k, for n>=0 and 0<=k<=2n.
-
preserver_image affine, shift 0
e-3a52de7742ed9314Affine, reversal and Möbius substitutions (elementary) polytool ?
-
premise (sequence):
a(n) = 1 if n is of the form m(m+3)/2, otherwise 0.
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
premise (sequence):
a(n) = 1 if n is of the form m(m+3)/2, otherwise 0.
-
↵ theorem_check liu_wang
-
premise (sequence):
binomial
-
↵ basis_map A007318
e-095baa2a9dfe188f(expanded above) -
↵ parent_provers periodic_product
e-13983862a411779c(expanded above) -
↵ preserver_image reversal, shift 0
e-989c95e5c893fce9(expanded above) -
↵ gamma_polynomial scale 1, shift 0
e-c76adc2a99cd3dea(expanded above) -
↵ preserver_image affine, shift 0
e-3a52de7742ed9314(expanded above)
-
-
premise (sequence):
binomial
-
-
premise (sequence):
Triangle of denominators in Leibniz's Harmonic Triangle a(n,k), n >= 1, 1 <= k <= n.
-
preserver_image euler_polynomial, shift 0
e-8595fb8ebe2c7ed6Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 40] polytool ?
-
premise (sequence):
Exponential Riordan array [x*exp(x),x].
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
preserver_image derivative_polynomial, shift 0
e-e846abf2e486a264Laguerre’s theorem on differential operators [SP14] polytool ?
-
premise (sequence):
binomial
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
↵ theorem_check liu_wang
e-317eb4ccca60c6ac(expanded above) -
↵ preserver_image reversal, shift 0
e-033cf842aad3bdf7(expanded above) -
↵ basis_map A007318
e-095baa2a9dfe188f(expanded above) -
↵ parent_provers periodic_product
e-13983862a411779c(expanded above) -
↵ preserver_image reversal, shift 0
e-989c95e5c893fce9(expanded above) -
↵ gamma_polynomial scale 1, shift 0
e-c76adc2a99cd3dea(expanded above) -
↵ preserver_image affine, shift 0
e-3a52de7742ed9314(expanded above)
-
↵ theorem_check liu_wang
-
premise (sequence):
binomial
-
preserver_image derivative_polynomial, shift 0
e-fea26a85ffb08669Laguerre’s theorem on differential operators [SP14] polytool ?
-
premise (sequence):
binomial
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
↵ theorem_check liu_wang
e-317eb4ccca60c6ac(expanded above) -
↵ preserver_image reversal, shift 0
e-033cf842aad3bdf7(expanded above) -
↵ basis_map A007318
e-095baa2a9dfe188f(expanded above) -
↵ parent_provers periodic_product
e-13983862a411779c(expanded above) -
↵ preserver_image reversal, shift 0
e-989c95e5c893fce9(expanded above) -
↵ gamma_polynomial scale 1, shift 0
e-c76adc2a99cd3dea(expanded above) -
↵ preserver_image affine, shift 0
e-3a52de7742ed9314(expanded above)
-
↵ theorem_check liu_wang
-
premise (sequence):
binomial
-
preserver_image affine, shift 0
e-b21ed9aa36fa01d5Affine, reversal and Möbius substitutions (elementary) polytool ?
-
premise (sequence):
Infinitesimal Pascal matrix: generator (lower triangular matrix representation) of the Pascal matrix, the classical ope…
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
preserver_image derivative_polynomial, shift 0
e-12f4d751ee3d86a1Laguerre’s theorem on differential operators [SP14] polytool ?
-
premise (sequence):
a(n) = 1 if n is of the form m(m+3)/2, otherwise 0.
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
premise (sequence):
a(n) = 1 if n is of the form m(m+3)/2, otherwise 0.
-
preserver_image derivative_polynomial, shift 0
e-9b7669248d59eaf8Laguerre’s theorem on differential operators [SP14] polytool ?
-
premise (sequence):
a(n) = 1 if n is of the form m(m+3)/2, otherwise 0.
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
premise (sequence):
a(n) = 1 if n is of the form m(m+3)/2, otherwise 0.
-
-
premise (sequence):
Infinitesimal Pascal matrix: generator (lower triangular matrix representation) of the Pascal matrix, the classical ope…
-
-
premise (sequence):
Exponential Riordan array [x*exp(x),x].
Related sequences ?
Same fingerprint (12)
Equal up to content, sign, reversal and a small index shift.
- A038208 → (θ+1)²
- A125092: Triangle read by rows: T(n,k) = (k+1)^2*binomial(n,k) (0 <= k <= n).
- A028326 → (θ+1)²
- A344565 → (θ+1)²
- A178822 → (θ+1)²
- A007318 → (θ+1)² → reverse
- A178821 → (θ+1)²
- A135838 → (θ+1)²
- A007318 → ×(1+2n+n²) → (θ+1)²
- basis-map coefficients of A113214, shifted → (θ+1)²
- A085880 → (θ+1)²
- A178820 → (θ+1)²
References
- [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
- [AW24] Christos A. Athanasiadis and David G. Wagner. Veronese sections and interlacing matrices of polynomials and formal power series. arXiv:2404.12989. arXiv
- [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
- [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
- [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
- [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.