A007318 → ×(1+2n+n²) → D
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
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | x8 | x9 | x10 | x11 | x12 | x13 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 0 | 0 | ||||||||||||||
| 1 | 4 | 4 | |||||||||||||
| 2 | 18 | 18 | 36 | ||||||||||||
| 3 | 48 | 96 | 48 | 192 | |||||||||||
| 4 | 100 | 300 | 300 | 100 | 800 | ||||||||||
| 5 | 180 | 720 | 1080 | 720 | 180 | 2880 | |||||||||
| 6 | 294 | 1470 | 2940 | 2940 | 1470 | 294 | 9408 | ||||||||
| 7 | 448 | 2688 | 6720 | 8960 | 6720 | 2688 | 448 | 28672 | |||||||
| 8 | 648 | 4536 | 13608 | 22680 | 22680 | 13608 | 4536 | 648 | 82944 | ||||||
| 9 | 900 | 7200 | 25200 | 50400 | 63000 | 50400 | 25200 | 7200 | 900 | 230400 | |||||
| 10 | 1210 | 10890 | 43560 | 101640 | 152460 | 152460 | 101640 | 43560 | 10890 | 1210 | 619520 | ||||
| 11 | 1584 | 15840 | 71280 | 190080 | 332640 | 399168 | 332640 | 190080 | 71280 | 15840 | 1584 | 1622016 | |||
| 12 | 2028 | 22308 | 111540 | 334620 | 669240 | 936936 | 936936 | 669240 | 334620 | 111540 | 22308 | 2028 | 4153344 | ||
| 13 | 2548 | 30576 | 168168 | 560560 | 1261260 | 2018016 | 2354352 | 2018016 | 1261260 | 560560 | 168168 | 30576 | 2548 | 10436608 | |
| 14 | 3150 | 40950 | 245700 | 900900 | 2252250 | 4054050 | 5405400 | 5405400 | 4054050 | 2252250 | 900900 | 245700 | 40950 | 3150 | 25804800 |
Computed in your browser ?
Technical details
- Node id
n-e7173f1a262fe3ce· revision 1 · JSON- Definition source
derived:derivative- Fingerprint
f6-77a7ed3b1d5f257e
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: 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 ?
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 ExampleTriangle begins: 0: 0; 1: 4; 2: 18, 18; 3: 48, 96, 48; 4: 100, 300, 300, 100; 5: 180, 720, 1080, 720, 180; 6: 294, 1470, 2940, 2940, 1470, 294; 7: 448, 2688, 6720, 8960, 6720, 2688, 448; 8: 648, 4536, 13608, 22680, 22680, 13608, 4536, 648; 9: 900, 7200, 25200, 50400, 63000, 50400, 25200, 7200, 900;
%F FormulaThe row polynomials satisfy (n^4-2*n^3+n^2)*P(n,x) = -(n^4+2*n^3+n^2+(2*n^4+4*n^3+2*n^2)*x+(n^4+2*n^3+n^2)*x^2)*P(n-2,x) + (2*n^4-4*n^2+2+(2*n^4-4*n^2+2)*x)*P(n-1,x) for n >= 2, with P(0,x) = 0, P(1,x) = 4.
%t MathematicaP[0, x_] := 0;
P[1, x_] := 4;
P[n_, x_] := P[n, x] = Expand[Together[(-(n^4 + 2*n^3 + n^2 + (2*n^4 + 4*n^3 + 2*n^2)*x + (n^4 + 2*n^3 + n^2)*x^2)*P[n - 2, x] + (2*n^4 - 4*n^2 + 2 + (2*n^4 - 4*n^2 + 2)*x)*P[n - 1, x])/(n^4 - 2*n^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] = 4; for(n = 2, N, my(i = n + 1); v[i] = (-(n^4 + 2*n^3 + n^2 + (2*n^4 + 4*n^3 + 2*n^2)*x + (n^4 + 2*n^3 + n^2)*x^2)*v[i - 2] + (2*n^4 - 4*n^2 + 2 + (2*n^4 - 4*n^2 + 2)*x)*v[i - 1])/(n^4 - 2*n^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-7f6c7a1231c5d5aa -
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-7f6c7a1231c5d5aa -
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-7f6c7a1231c5d5aa
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
-
preserver_image derivative_polynomial, shift 0
e-7f6c7a1231c5d5aaLaguerre’s theorem on differential operators [SP14] polytool ?
-
premise (sequence):
A127733 * A007318 as infinite lower triangular matrices.
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
preserver_image euler_polynomial, shift 0
e-b78deffc64bc1942Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 40] 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-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
-
preserver_image reversal, shift 0
e-f15d78d6731b57c8Affine, reversal and Möbius substitutions (elementary) polytool ?
-
premise (sequence):
A127733 * A007318 as infinite lower triangular matrices.
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
↵ preserver_image euler_polynomial, shift 0
e-b78deffc64bc1942(expanded above) -
preserver_image affine, shift 0
e-7157ac2ddeb657bfAffine, reversal and Möbius substitutions (elementary) polytool ?
-
premise (sequence):
Triangle read by rows: n-th row is n^2 preceded by (n-1) zeros.
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
preserver_image euler_polynomial, shift 0
e-2da0845bd9c8c38cLaguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 40] 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 reversal, shift 0
e-d2ec3b49898958f3Affine, reversal and Möbius substitutions (elementary) polytool ?
-
premise (sequence):
a(n) = 1 if n is a triangular number, otherwise 0.
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
preserver_image euler_polynomial, shift 0
e-01080164ff17b795Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 40] polytool ?
-
premise (sequence):
a(n) = 1 if n is a triangular number, otherwise 0.
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
basis_map A008277
e-17b9246d5ae52c95Ray basis map theorem [MW08, Thm 2] polytool RealRooted rayBasisMap_maps_realRootedIn_iff ?
-
premise (sequence):
a(n) = 1 if n is a triangular number, otherwise 0.
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
parent_provers periodic_product
e-249b7eaa76a03e97root: theorem checkParent-row provers of polytool polytool ?
-
basis_map A013609
e-35224690d27a26b2Geometric basis map (elementary) polytool ?
-
premise (sequence):
a(n) = 1 if n is a triangular number, otherwise 0.
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
↵ parent_provers periodic_product
e-249b7eaa76a03e97(expanded above) -
gamma_polynomial scale 1, shift 0
e-3c3f8de32007e148Gamma criterion RealRooted IsGammaExpansion.isRealRooted_and_hasRootsNonpos_iff ?
-
premise (sequence):
Even-numbered rows of Pascal's triangle.
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
parent_provers periodic_product
e-0029b53144d984cfroot: theorem checkParent-row provers of polytool polytool ?
-
preserver_image reversal, shift 0
e-a3e5463f21dc8d9dAffine, reversal and Möbius substitutions (elementary) polytool ?
-
premise (sequence):
Even-numbered rows of Pascal's triangle.
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
↵ parent_provers periodic_product
e-0029b53144d984cf(expanded above) -
basis_map A007318
e-fc612a08cfe0bbb6Geometric basis map (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…
-
preserver_image affine, shift 0
e-5b79b5b4d4f1c577Affine, 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…
-
↵ parent_provers periodic_product
-
premise (sequence):
Even-numbered rows of Pascal's triangle.
-
↵ basis_map A007318
e-fc612a08cfe0bbb6(expanded above) -
↵ preserver_image affine, shift 0
e-5b79b5b4d4f1c577(expanded above)
-
-
premise (sequence):
Even-numbered rows of Pascal's triangle.
-
basis_map A013610
e-3e8a15c56023eda3Geometric basis map (elementary) polytool ?
-
premise (sequence):
a(n) = 1 if n is a triangular number, otherwise 0.
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
↵ parent_provers periodic_product
e-249b7eaa76a03e97(expanded above) -
↵ gamma_polynomial scale 1, shift 0
e-3c3f8de32007e148(expanded above) -
preserver_image reversal, shift 0
e-4b431952cda59e9dAffine, 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.
-
preserver_image reversal, shift 0
e-68bece1a3264cb39Affine, 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…
-
basis_map A007318
e-99f76b7466efc63dGeometric basis map (elementary) polytool ?
-
premise (sequence):
a(n) = 1 if n is a triangular number, otherwise 0.
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
↵ parent_provers periodic_product
e-249b7eaa76a03e97(expanded above) -
↵ gamma_polynomial scale 1, shift 0
e-3c3f8de32007e148(expanded above) -
↵ preserver_image reversal, shift 0
e-4b431952cda59e9d(expanded above) -
↵ preserver_image reversal, shift 0
e-68bece1a3264cb39(expanded above) -
veronese_section r=2, j=0, shift 0
e-a4c5b7fb551c21c9Veronese sections of Pólya frequency sequences [ASW52; Edr53; AW24] polytool ?
-
premise (sequence):
a(n) = 1 if n is a triangular number, otherwise 0.
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
↵ parent_provers periodic_product
e-249b7eaa76a03e97(expanded above) -
↵ gamma_polynomial scale 1, shift 0
e-3c3f8de32007e148(expanded above) -
↵ preserver_image reversal, shift 0
e-4b431952cda59e9d(expanded above) -
↵ preserver_image reversal, shift 0
e-68bece1a3264cb39(expanded above) -
preserver_image reversal, shift 0
e-a877a82e81f28b82Affine, reversal and Möbius substitutions (elementary) polytool ?
-
premise (sequence):
a(n) = 1 if n is a triangular number, otherwise 0.
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
↵ parent_provers periodic_product
e-249b7eaa76a03e97(expanded above) -
↵ gamma_polynomial scale 1, shift 0
e-3c3f8de32007e148(expanded above) -
↵ preserver_image reversal, shift 0
e-4b431952cda59e9d(expanded above) -
↵ preserver_image reversal, shift 0
e-68bece1a3264cb39(expanded above) -
gamma_polynomial scale 1, shift 0
e-abb1d38cae3c521aGamma criterion RealRooted IsGammaExpansion.isRealRooted_and_hasRootsNonpos_iff ?
-
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-b6c6a979053116b3Laguerre’s theorem on differential operators [SP14] polytool ?
-
premise (sequence):
a(n) = 1 if n is a triangular number, otherwise 0.
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
↵ parent_provers periodic_product
e-249b7eaa76a03e97(expanded above) -
↵ gamma_polynomial scale 1, shift 0
e-3c3f8de32007e148(expanded above) -
↵ preserver_image reversal, shift 0
e-4b431952cda59e9d(expanded above) -
↵ preserver_image reversal, shift 0
e-68bece1a3264cb39(expanded above) -
↵ gamma_polynomial scale 1, shift 0
e-abb1d38cae3c521a(expanded above) -
preserver_image euler_polynomial, shift 0
e-ccf167b9b4684400Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 40] polytool ?
-
premise (sequence):
a(n) = 1 if n is a triangular number, otherwise 0.
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
↵ parent_provers periodic_product
e-249b7eaa76a03e97(expanded above) -
↵ gamma_polynomial scale 1, shift 0
e-3c3f8de32007e148(expanded above) -
↵ preserver_image reversal, shift 0
e-4b431952cda59e9d(expanded above) -
↵ preserver_image reversal, shift 0
e-68bece1a3264cb39(expanded above) -
↵ gamma_polynomial scale 1, shift 0
e-abb1d38cae3c521a(expanded above) -
basis_map A013611
e-e9fed022b38b6e62Geometric basis map (elementary) polytool ?
-
premise (sequence):
a(n) = 1 if n is a triangular number, otherwise 0.
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
↵ parent_provers periodic_product
e-249b7eaa76a03e97(expanded above) -
↵ gamma_polynomial scale 1, shift 0
e-3c3f8de32007e148(expanded above) -
↵ preserver_image reversal, shift 0
e-4b431952cda59e9d(expanded above) -
↵ preserver_image reversal, shift 0
e-68bece1a3264cb39(expanded above) -
↵ gamma_polynomial scale 1, shift 0
e-abb1d38cae3c521a(expanded above) -
preserver_image affine, shift 0
e-f5eca334b4637498Affine, reversal and Möbius substitutions (elementary) polytool ?
-
premise (sequence):
a(n) = 1 if n is a triangular number, otherwise 0.
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
↵ parent_provers periodic_product
e-249b7eaa76a03e97(expanded above) -
↵ gamma_polynomial scale 1, shift 0
e-3c3f8de32007e148(expanded above) -
↵ preserver_image reversal, shift 0
e-4b431952cda59e9d(expanded above) -
↵ preserver_image reversal, shift 0
e-68bece1a3264cb39(expanded above) -
↵ gamma_polynomial scale 1, shift 0
e-abb1d38cae3c521a(expanded above) -
preserver_image mobius, shift 0
e-b80fd10f36f0471fAffine, reversal and Möbius substitutions (elementary) polytool ?
-
premise (sequence):
a(n) = 1 if n is a triangular number, otherwise 0.
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
↵ parent_provers periodic_product
e-249b7eaa76a03e97(expanded above) -
↵ gamma_polynomial scale 1, shift 0
e-3c3f8de32007e148(expanded above) -
↵ preserver_image reversal, shift 0
e-4b431952cda59e9d(expanded above) -
↵ preserver_image reversal, shift 0
e-68bece1a3264cb39(expanded above) -
↵ gamma_polynomial scale 1, shift 0
e-abb1d38cae3c521a(expanded above) -
basis_map A008288
e-8ef103093ba4177dAffine-current basis map theorem polytool RealRooted orderTwoConstants_nonneg_iff ?
-
premise (sequence):
a(n) = 1 if n is a triangular number, otherwise 0.
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in [-10368968295/4294967296, 0]no recorded property covers this requirement
-
premise (sequence):
a(n) = 1 if n is a triangular number, otherwise 0.
-
basis_map A008288
e-54652e8af65208a6Affine-current basis map theorem polytool RealRooted orderTwoConstants_nonneg_iff ?
-
premise (sequence):
a(n) = 1 if n is a triangular number, otherwise 0.
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in [-10368968295/4294967296, 0]no recorded property covers this requirement
-
premise (sequence):
a(n) = 1 if n is a triangular number, otherwise 0.
-
↵ parent_provers periodic_product
-
premise (sequence):
a(n) = 1 if n is a triangular number, otherwise 0.
-
↵ basis_map A008288
e-8ef103093ba4177d(expanded above) -
↵ basis_map A008288
e-54652e8af65208a6(expanded above)
-
↵ parent_provers periodic_product
-
premise (sequence):
a(n) = 1 if n is a triangular number, otherwise 0.
-
↵ preserver_image mobius, shift 0
e-b80fd10f36f0471f(expanded above) -
↵ basis_map A008288
e-8ef103093ba4177d(expanded above) -
↵ basis_map A008288
e-54652e8af65208a6(expanded above)
-
↵ parent_provers periodic_product
-
premise (sequence):
a(n) = 1 if n is a triangular number, otherwise 0.
-
↵ preserver_image affine, shift 0
e-f5eca334b4637498(expanded above) -
↵ preserver_image mobius, shift 0
e-b80fd10f36f0471f(expanded above) -
↵ basis_map A008288
e-8ef103093ba4177d(expanded above) -
↵ basis_map A008288
e-54652e8af65208a6(expanded above)
-
↵ parent_provers periodic_product
-
premise (sequence):
a(n) = 1 if n is a triangular number, otherwise 0.
-
↵ basis_map A013611
e-e9fed022b38b6e62(expanded above) -
↵ preserver_image affine, shift 0
e-f5eca334b4637498(expanded above) -
↵ preserver_image mobius, shift 0
e-b80fd10f36f0471f(expanded above) -
↵ basis_map A008288
e-8ef103093ba4177d(expanded above) -
↵ basis_map A008288
e-54652e8af65208a6(expanded above)
-
↵ parent_provers periodic_product
-
premise (sequence):
a(n) = 1 if n is a triangular number, otherwise 0.
-
↵ preserver_image euler_polynomial, shift 0
e-ccf167b9b4684400(expanded above) -
↵ basis_map A013611
e-e9fed022b38b6e62(expanded above) -
↵ preserver_image affine, shift 0
e-f5eca334b4637498(expanded above) -
↵ preserver_image mobius, shift 0
e-b80fd10f36f0471f(expanded above) -
↵ basis_map A008288
e-8ef103093ba4177d(expanded above) -
↵ basis_map A008288
e-54652e8af65208a6(expanded above)
-
↵ parent_provers periodic_product
-
premise (sequence):
a(n) = 1 if n is a triangular number, otherwise 0.
-
↵ gamma_polynomial scale 1, shift 0
e-abb1d38cae3c521a(expanded above) -
↵ preserver_image derivative_polynomial, shift 0
e-b6c6a979053116b3(expanded above) -
↵ preserver_image euler_polynomial, shift 0
e-ccf167b9b4684400(expanded above) -
↵ basis_map A013611
e-e9fed022b38b6e62(expanded above) -
↵ preserver_image affine, shift 0
e-f5eca334b4637498(expanded above) -
↵ preserver_image mobius, shift 0
e-b80fd10f36f0471f(expanded above) -
↵ basis_map A008288
e-8ef103093ba4177d(expanded above) -
↵ basis_map A008288
e-54652e8af65208a6(expanded above)
-
↵ parent_provers periodic_product
-
premise (sequence):
a(n) = 1 if n is a triangular number, otherwise 0.
-
↵ preserver_image reversal, shift 0
e-a877a82e81f28b82(expanded above) -
↵ gamma_polynomial scale 1, shift 0
e-abb1d38cae3c521a(expanded above) -
↵ preserver_image derivative_polynomial, shift 0
e-b6c6a979053116b3(expanded above) -
↵ preserver_image euler_polynomial, shift 0
e-ccf167b9b4684400(expanded above) -
↵ basis_map A013611
e-e9fed022b38b6e62(expanded above) -
↵ preserver_image affine, shift 0
e-f5eca334b4637498(expanded above) -
↵ preserver_image mobius, shift 0
e-b80fd10f36f0471f(expanded above) -
↵ basis_map A008288
e-8ef103093ba4177d(expanded above) -
↵ basis_map A008288
e-54652e8af65208a6(expanded above)
-
↵ parent_provers periodic_product
-
premise (sequence):
a(n) = 1 if n is a triangular number, otherwise 0.
-
↵ veronese_section r=2, j=0, shift 0
e-a4c5b7fb551c21c9(expanded above) -
↵ preserver_image reversal, shift 0
e-a877a82e81f28b82(expanded above) -
↵ gamma_polynomial scale 1, shift 0
e-abb1d38cae3c521a(expanded above) -
↵ preserver_image derivative_polynomial, shift 0
e-b6c6a979053116b3(expanded above) -
↵ preserver_image euler_polynomial, shift 0
e-ccf167b9b4684400(expanded above) -
↵ basis_map A013611
e-e9fed022b38b6e62(expanded above) -
↵ preserver_image affine, shift 0
e-f5eca334b4637498(expanded above) -
↵ preserver_image mobius, shift 0
e-b80fd10f36f0471f(expanded above) -
↵ basis_map A008288
e-8ef103093ba4177d(expanded above) -
↵ basis_map A008288
e-54652e8af65208a6(expanded above)
-
↵ parent_provers periodic_product
-
premise (sequence):
a(n) = 1 if n is a triangular number, otherwise 0.
-
↵ preserver_image reversal, shift 0
e-4b431952cda59e9d(expanded above) -
↵ preserver_image reversal, shift 0
e-68bece1a3264cb39(expanded above) -
↵ basis_map A007318
e-99f76b7466efc63d(expanded above) -
↵ veronese_section r=2, j=0, shift 0
e-a4c5b7fb551c21c9(expanded above) -
↵ preserver_image reversal, shift 0
e-a877a82e81f28b82(expanded above) -
↵ gamma_polynomial scale 1, shift 0
e-abb1d38cae3c521a(expanded above) -
↵ preserver_image derivative_polynomial, shift 0
e-b6c6a979053116b3(expanded above) -
↵ preserver_image euler_polynomial, shift 0
e-ccf167b9b4684400(expanded above) -
↵ basis_map A013611
e-e9fed022b38b6e62(expanded above) -
↵ preserver_image affine, shift 0
e-f5eca334b4637498(expanded above) -
↵ preserver_image mobius, shift 0
e-b80fd10f36f0471f(expanded above) -
↵ basis_map A008288
e-8ef103093ba4177d(expanded above) -
↵ basis_map A008288
e-54652e8af65208a6(expanded above)
-
↵ parent_provers periodic_product
-
premise (sequence):
a(n) = 1 if n is a triangular number, otherwise 0.
-
↵ gamma_polynomial scale 1, shift 0
e-3c3f8de32007e148(expanded above) -
↵ basis_map A013610
e-3e8a15c56023eda3(expanded above) -
↵ preserver_image reversal, shift 0
e-4b431952cda59e9d(expanded above) -
↵ preserver_image reversal, shift 0
e-68bece1a3264cb39(expanded above) -
↵ basis_map A007318
e-99f76b7466efc63d(expanded above) -
↵ veronese_section r=2, j=0, shift 0
e-a4c5b7fb551c21c9(expanded above) -
↵ preserver_image reversal, shift 0
e-a877a82e81f28b82(expanded above) -
↵ gamma_polynomial scale 1, shift 0
e-abb1d38cae3c521a(expanded above) -
↵ preserver_image derivative_polynomial, shift 0
e-b6c6a979053116b3(expanded above) -
↵ preserver_image euler_polynomial, shift 0
e-ccf167b9b4684400(expanded above) -
↵ basis_map A013611
e-e9fed022b38b6e62(expanded above) -
↵ preserver_image affine, shift 0
e-f5eca334b4637498(expanded above) -
↵ preserver_image mobius, shift 0
e-b80fd10f36f0471f(expanded above) -
↵ basis_map A008288
e-8ef103093ba4177d(expanded above) -
↵ basis_map A008288
e-54652e8af65208a6(expanded above)
-
-
premise (sequence):
a(n) = 1 if n is a triangular number, otherwise 0.
-
↵ parent_provers periodic_product
e-249b7eaa76a03e97(expanded above) -
↵ basis_map A013609
e-35224690d27a26b2(expanded above) -
↵ gamma_polynomial scale 1, shift 0
e-3c3f8de32007e148(expanded above) -
↵ basis_map A013610
e-3e8a15c56023eda3(expanded above) -
↵ preserver_image reversal, shift 0
e-4b431952cda59e9d(expanded above) -
↵ preserver_image reversal, shift 0
e-68bece1a3264cb39(expanded above) -
↵ basis_map A007318
e-99f76b7466efc63d(expanded above) -
↵ veronese_section r=2, j=0, shift 0
e-a4c5b7fb551c21c9(expanded above) -
↵ preserver_image reversal, shift 0
e-a877a82e81f28b82(expanded above) -
↵ gamma_polynomial scale 1, shift 0
e-abb1d38cae3c521a(expanded above) -
↵ preserver_image derivative_polynomial, shift 0
e-b6c6a979053116b3(expanded above) -
↵ preserver_image euler_polynomial, shift 0
e-ccf167b9b4684400(expanded above) -
↵ basis_map A013611
e-e9fed022b38b6e62(expanded above) -
↵ preserver_image affine, shift 0
e-f5eca334b4637498(expanded above) -
↵ preserver_image mobius, shift 0
e-b80fd10f36f0471f(expanded above) -
↵ basis_map A008288
e-8ef103093ba4177d(expanded above) -
↵ basis_map A008288
e-54652e8af65208a6(expanded above)
-
-
premise (sequence):
a(n) = 1 if n is a triangular number, otherwise 0.
-
↵ basis_map A008277
e-17b9246d5ae52c95(expanded above) -
↵ parent_provers periodic_product
e-249b7eaa76a03e97(expanded above) -
↵ basis_map A013609
e-35224690d27a26b2(expanded above) -
↵ gamma_polynomial scale 1, shift 0
e-3c3f8de32007e148(expanded above) -
↵ basis_map A013610
e-3e8a15c56023eda3(expanded above) -
↵ preserver_image reversal, shift 0
e-4b431952cda59e9d(expanded above) -
↵ preserver_image reversal, shift 0
e-68bece1a3264cb39(expanded above) -
↵ basis_map A007318
e-99f76b7466efc63d(expanded above) -
↵ veronese_section r=2, j=0, shift 0
e-a4c5b7fb551c21c9(expanded above) -
↵ preserver_image reversal, shift 0
e-a877a82e81f28b82(expanded above) -
↵ gamma_polynomial scale 1, shift 0
e-abb1d38cae3c521a(expanded above) -
↵ preserver_image derivative_polynomial, shift 0
e-b6c6a979053116b3(expanded above) -
↵ preserver_image euler_polynomial, shift 0
e-ccf167b9b4684400(expanded above) -
↵ basis_map A013611
e-e9fed022b38b6e62(expanded above) -
↵ preserver_image affine, shift 0
e-f5eca334b4637498(expanded above) -
↵ preserver_image mobius, shift 0
e-b80fd10f36f0471f(expanded above) -
↵ basis_map A008288
e-8ef103093ba4177d(expanded above) -
↵ basis_map A008288
e-54652e8af65208a6(expanded above)
-
-
premise (sequence):
a(n) = 1 if n is a triangular number, otherwise 0.
-
preserver_image mobius, shift 0
e-cfab14fd1f17e553Affine, reversal and Möbius substitutions (elementary) polytool ?
-
premise (sequence):
Triangle read by rows: n-th row is n^2 preceded by (n-1) zeros.
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
premise (sequence):
Triangle read by rows: n-th row is n^2 preceded by (n-1) zeros.
-
-
premise (sequence):
Triangle read by rows: n-th row is n^2 preceded by (n-1) zeros.
-
↵ preserver_image euler_polynomial, shift 0
-
premise (sequence):
A127733 * A007318 as infinite lower triangular matrices.
-
↵ preserver_image affine, shift 0
e-7157ac2ddeb657bf(expanded above)
-
-
premise (sequence):
A127733 * A007318 as infinite lower triangular matrices.
Related sequences ?
Same fingerprint (59)
Equal up to content, sign, reversal and a small index shift.
- A028326 → basis A013609
- A038325 → basis A013609
- A344565 → D
- Triangle whose (i,j)-th entry is binomial(i,j)*12^(i-j)*12^j.
- basis-map coefficients of A026729 → basis A007318
- basis-map coefficients of A113214, shifted → D
- A216973: Exponential Riordan array [x*exp(x),x].
- A085880 → D
- A156992 → basis A013609
- A007318: Binomial
- A038208 → D
- A356546 → basis A013609
- A003506: Triangle of denominators in Leibniz's Harmonic Triangle a(n,k), n >= 1, 1 <= k <= n.
- A085880: Triangle T(n,k) read by rows: multiply row n of Pascal's triangle (A007318) by the n-th Catalan number (A00010…
- A007318 → D → D
- basis-map coefficients of A113214, shifted → basis A013609
- A007318 → ×(1+(3/2)n+(1/2)n²) → D
- A178821 → D
- A178822 → D
- A156992: Triangle T(n,k) = n!*binomial(n-1, k-1) for 1 <= k <= n, read by rows.
- basis-map coefficients of A112227 → x ↦ x+1
- basis-map coefficients of A021012 → x ↦ x+1
- A178821: Triangle read by rows: T(n,k) = binomial(n+4,4) * binomial(n,k), 0 <= k <= n.
- A178820 → basis A013609
- A135838 → basis A013609
- A038338 → basis A013609
- A038221 → basis A013609
- A196347: Triangle T(n, k) read by rows, T(n, k) = n!*binomial(n, k).
- A178820: Triangle read by rows: T(n,k) = C(n+3,3) * C(n,k), 0 <= k <= n.
- A085880 → basis A013609
- A085881: Triangle T(n,k) read by rows: multiply row n of Pascal's triangle (A007318) by A001147(n).
- A344565: Triangle read by rows, for 0 <= k <= n: T(n, k) = binomial(n, k) * binomial(binomial(n + 3, 2), 2).
- A196347 → basis A013609
- A129533: Array read by antidiagonals: T(n,k) = binomial(n+1,2)*binomial(n+k,n+1) for 0 <= k <= n.
- A178821 → basis A013609
- A178822 → basis A013609
- A178822: Triangle read by rows: T(n,k) = C(n+5,5) * C(n,k), 0 <= k <= n.
- A038330 → basis A013611
- A135838: Triangle read by rows: T(n,k) = 2^floor(n/2)*binomial(n-1,k-1).
- A237765: Triangular array read by rows: T(n,k) = binomial(n,2)*binomial(n,k), n>=0, 0<=k<=n.
- A038208: Triangle whose (i,j)-th entry is binomial(i,j)*2^i.
- Riordan array (1-x,x/(1-x)).
- A135065: A127733 * A007318 as infinite lower triangular matrices.
- A120910 → basis A013610
- A356546: Triangle read by rows. T(n, k) = RisingFactorial(n + 1, n) / (k! * (n - k)!).
- A028326: Twice Pascal's triangle A007318: T(n,k) = 2*C(n,k).
- A027465 → basis A013611
- A135838 → D
- basis-map coefficients of Riordan array (1+2x,x(1+x)). shifted by x -> -x + 0
- A038325: Triangle read by rows whose (i,j)-th entry is binomial(i,j)*11^(i-j)*11^j.
- A094305: Triangle read by rows: T(n,k) = ((n+1)(n+2)/2) * binomial(n,k) (0 <= k <= n).
- A344565 → basis A013609
- A028326 → D
- A010054 → reverse → x ↦ x+1
- A038221: Triangle whose (i,j)-th entry is binomial(i,j)*3^(i-j)*3^j.
- A178820 → D
- A007318 → ×(−(1/2)n+(1/2)n²) → D
- basis-map coefficients of A026729, shifted → basis A007318
- A085881 → basis A013609
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
- [MW08] Shi-Mei Ma and Yi Wang. q-Eulerian polynomials and polynomials with only real zeros. The Electronic Journal of Combinatorics, 15(1):Research Paper 17, January 2008. doi:10.37236/741
- [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.