A038207 → D
nonnegative coefficients only rational roots
Proved for all n: all roots real, in (−∞, −1] · coefficients of one sign · interlacing (weak) · 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 | 1 | 1 | |||||||||||||
| 2 | 4 | 2 | 6 | ||||||||||||
| 3 | 12 | 12 | 3 | 27 | |||||||||||
| 4 | 32 | 48 | 24 | 4 | 108 | ||||||||||
| 5 | 80 | 160 | 120 | 40 | 5 | 405 | |||||||||
| 6 | 192 | 480 | 480 | 240 | 60 | 6 | 1458 | ||||||||
| 7 | 448 | 1344 | 1680 | 1120 | 420 | 84 | 7 | 5103 | |||||||
| 8 | 1024 | 3584 | 5376 | 4480 | 2240 | 672 | 112 | 8 | 17496 | ||||||
| 9 | 2304 | 9216 | 16128 | 16128 | 10080 | 4032 | 1008 | 144 | 9 | 59049 | |||||
| 10 | 5120 | 23040 | 46080 | 53760 | 40320 | 20160 | 6720 | 1440 | 180 | 10 | 196830 | ||||
| 11 | 11264 | 56320 | 126720 | 168960 | 147840 | 88704 | 36960 | 10560 | 1980 | 220 | 11 | 649539 | |||
| 12 | 24576 | 135168 | 337920 | 506880 | 506880 | 354816 | 177408 | 63360 | 15840 | 2640 | 264 | 12 | 2125764 | ||
| 13 | 53248 | 319488 | 878592 | 1464320 | 1647360 | 1317888 | 768768 | 329472 | 102960 | 22880 | 3432 | 312 | 13 | 6908733 | |
| 14 | 114688 | 745472 | 2236416 | 4100096 | 5125120 | 4612608 | 3075072 | 1537536 | 576576 | 160160 | 32032 | 4368 | 364 | 14 | 22320522 |
Generated b-files: A027471 (row sums) ?
Computed in your browser ?
Technical details
- Node id
n-7c4e320f16a7ccb1· revision 2 · JSON- Definition source
derived:shift_x_plus_one- Fingerprint
f6-11aec07ce60b6d61
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 ℚ): yes
OEIS matches ?
- A027471: row sums, 15 terms agree OEIS nonn (row-sum match: finite agreement only) · view at the OEIS · generated b-file 200 terms from n = 1 ?
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: 4, 2; 3: 12, 12, 3; 4: 32, 48, 24, 4; 5: 80, 160, 120, 40, 5; 6: 192, 480, 480, 240, 60, 6; 7: 448, 1344, 1680, 1120, 420, 84, 7; 8: 1024, 3584, 5376, 4480, 2240, 672, 112, 8; 9: 2304, 9216, 16128, 16128, 10080, 4032, 1008, 144, 9;
%F FormulaThe row polynomials satisfy (n-1)*P(n,x) = (2*n+n*x)*P(n-1,x) for n >= 2, with P(0,x) = 0, P(1,x) = 1.
%t MathematicaP[0, x_] := 0;
P[1, x_] := 1;
P[n_, x_] := P[n, x] = Expand[Together[((2*n + n*x)*P[n - 1, x])/(n - 1)]];
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; for(n = 2, N, my(i = n + 1); v[i] = ((2*n + n*x)*v[i - 1])/(n - 1)); 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, -1]
Every polynomial of the sequence has only real roots, inside the stated interval.by the cited steps:
e-d66a62e99e497f2a -
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-d66a62e99e497f2a,e-fd845f603f8fe831 -
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-d66a62e99e497f2a,e-fd845f603f8fe831 -
Real-rooted. Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, -1]
Every polynomial of the sequence has only real roots, inside the stated interval.by the cited steps:
e-1a916fd0c60fb95f -
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-1a916fd0c60fb95f -
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-1a916fd0c60fb95f -
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-fd845f603f8fe831 -
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-fd845f603f8fe831
Proof chains
3 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 affine, shift 0
e-1a916fd0c60fb95fAffine, reversal and Möbius substitutions (elementary) 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 affine, shift 0
e-d66a62e99e497f2aAffine, reversal and Möbius substitutions (elementary) 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].
-
preserver_image derivative_polynomial, shift 0
e-fd845f603f8fe831Laguerre’s theorem on differential operators [SP14] polytool ?
-
premise (sequence):
Triangle whose (i,j)-th entry is binomial(i,j)*2^(i-j).
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
theorem_check liu_wang
e-0d085d05819c04f2root: theorem checkLiu–Wang theorem [LW07, Thm 2.1, Cor 2.4] ?
-
preserver_image reversal, shift 0
e-045f9d56b54ceaf2Affine, reversal and Möbius substitutions (elementary) polytool ?
-
premise (sequence):
Triangle of coefficients in expansion of (1+2*x)^n.
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
theorem_check liu_wang
e-a6866143cc223753root: theorem checkLiu–Wang theorem [LW07, Thm 2.1, Cor 2.4] ?
-
basis_map A013609
e-41b2234a78052e4fGeometric 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]
-
premise (sequence):
a(n) = 1 if n is of the form m(m+3)/2, otherwise 0.
-
gamma_polynomial scale 1, shift 0
e-4c4f74d9ba733cffGamma criterion RealRooted IsGammaExpansion.isRealRooted_and_hasRootsNonpos_iff ?
-
premise (sequence):
Triangle read by rows, T(n,k) = GegenbauerC(m,-n,-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-eab26daf7024ea74root: theorem checkParent-row provers of polytool polytool ?
-
-
premise (sequence):
Triangle read by rows, T(n,k) = GegenbauerC(m,-n,-2) where m = k if k<n else 2*n-k, for n>=0 and 0<=k<=2n.
-
preserver_image reversal, shift 0
e-6d15baf5e54583eeAffine, reversal and Möbius substitutions (elementary) polytool ?
-
premise (sequence):
Triangle whose (i,j)-th entry is binomial(i,j)*2^(i-j).
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
↵ theorem_check liu_wang
e-0d085d05819c04f2(expanded above) -
parent_provers periodic_product
e-1697ba43e31b7729root: theorem checkParent-row provers of polytool polytool ?
-
basis_map A007318
e-4608a916413bc814Geometric basis map (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) -
↵ 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-17c52917511dc051Affine, 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) -
↵ 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
-
↵ theorem_check liu_wang
-
premise (sequence):
Triangle whose (i,j)-th entry is binomial(i,j)*2^(i-j).
-
parent_provers periodic_product
e-d08b7f9df01d4f3croot: theorem checkParent-row provers of polytool polytool ?
-
preserver_image mobius, shift 0
e-2c323256b27180b8Affine, 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) -
↵ 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
-
-
premise (sequence):
Triangle of coefficients in expansion of (1+2*x)^n.
-
↵ parent_provers periodic_product
e-1697ba43e31b7729(expanded above) -
↵ basis_map A007318
e-4608a916413bc814(expanded above) -
↵ preserver_image affine, shift 0
e-17c52917511dc051(expanded above)
-
-
premise (sequence):
Triangle whose (i,j)-th entry is binomial(i,j)*2^(i-j).
Related sequences ?
Same fingerprint (67)
Equal up to content, sign, reversal and a small index shift.
- A007318 → ×(−(1/2)n+(1/2)n²) → x ↦ x+1
- A178820 → basis A007318
- A028326 → basis A007318
- A028326 → x ↦ x/(x+1)
- basis-map coefficients of A030528, shifted → basis A013609
- A135838 → basis A013611
- A038207: Triangle whose (i,j)-th entry is binomial(i,j)*2^(i-j).
- A120909 → D
- A007318 → ×(1+2n+n²) → x ↦ x/(x+1)
- A344565 → basis A013611
- A007318 → ×(−(1/2)n+(1/2)n²) → x ↦ x/(x+1)
- A120909: Triangle read by rows: T(n,k) is the number of ternary words of length n having k runs (i.e., subwords of maxi…
- basis-map coefficients of A113214, shifted → basis A013611
- A085880 → x ↦ x/(x+1)
- A038325 → basis A007318
- A159854 → x ↦ x/(x+1)
- A013609 → basis A013610
- A038330 → basis A013609
- A038325 → basis A013611
- A178822 → x ↦ x+1
- A038221 → basis A013611
- A178822 → x ↦ x/(x+1)
- basis-map coefficients of A026729 → basis A013609
- A013609: Triangle of coefficients in expansion of (1+2*x)^n.
- basis-map coefficients of A113214, shifted → x ↦ x/(x+1)
- A007318 → ×(1+2n+n²) → x ↦ x+1
- basis-map coefficients of A021012 → basis A013609
- A356546 → basis A013611
- A028326 → basis A013611
- A027466 → basis A013611
- A120909 → basis A013610
- A085880 → x ↦ x+1
- A135838 → x ↦ x+1
- A038338 → basis A007318
- A136572 → basis A013609
- A178822 → basis A013611
- A038338 → basis A013611
- A038208 → x ↦ x/(x+1)
- A007318 → ×(1+(3/2)n+(1/2)n²) → x ↦ x+1
- A007318 → D → x ↦ x/(x+1)
- A178821 → basis A007318
- A130123 → basis A013609
- A344565 → x ↦ x/(x+1)
- A085881 → basis A013611
- A135838 → x ↦ x/(x+1)
- A085880 → basis A013611
- A120910 → D
- basis-map coefficients of A113214, shifted → x ↦ x+1
- basis-map coefficients of A026729, shifted → basis A013609
- A007318 → ×(1+(3/2)n+(1/2)n²) → x ↦ x/(x+1)
- A120910: Triangle read by rows: T(n,k) is the number of ternary words of length n having k levels (n >= 1, 0 <= k <= n-…
- A013609 → D
- A156992 → basis A007318
- A178820 → basis A013611
- A356546 → basis A007318
- A196347 → basis A007318
- A038208 → basis A013611
- A178820 → x ↦ x/(x+1)
- A038243 → basis A013610
- A085881 → basis A007318
- A156992 → basis A013611
- A038208 → basis A007318
- A178821 → x ↦ x/(x+1)
- basis-map coefficients of A112227 → basis A013609
- A196347 → basis A013611
- A344565 → basis A007318
- A178821 → basis A013611
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
- [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.