basis-map coefficients of A113214, shifted → D
palindromic 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 | Pn(1) |
|---|---|---|---|---|---|---|---|---|
| 0 | 0 | |||||||
| 1 | -1 | -1 | ||||||
| 2 | 2 | 2 | 4 | |||||
| 3 | -3 | -6 | -3 | -12 | ||||
| 4 | 4 | 12 | 12 | 4 | 32 | |||
| 5 | -5 | -20 | -30 | -20 | -5 | -80 | ||
| 6 | 6 | 30 | 60 | 60 | 30 | 6 | 192 | |
| 7 | -7 | -42 | -105 | -140 | -105 | -42 | -7 | -448 |
Generated b-files: A085750 (row sums) ?
Computed in your browser ?
Technical details
- Node id
n-f6b66860ba98a2c1· 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): no
- Nonnegative coefficients (
nonn): no - Only rational roots (
rr_by_factors: every nonzero row is a product of linear factors over ℚ): yes
OEIS matches ?
- A085750: row sums, 15 terms agree (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: 2, 2; 3: -3, -6, -3; 4: 4, 12, 12, 4; 5: -5, -20, -30, -20, -5; 6: 6, 30, 60, 60, 30, 6; 7: -7, -42, -105, -140, -105, -42, -7; 8: 8, 56, 168, 280, 280, 168, 56, 8; 9: -9, -72, -252, -504, -630, -504, -252, -72, -9;
%F FormulaThe row polynomials satisfy (n-1)*P(n,x) = -(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[(-(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] = (-(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, 0]
Every polynomial of the sequence has only real roots, inside the stated interval.by the cited steps:
e-3c99f80a26484c6d -
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-3c99f80a26484c6d -
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-3c99f80a26484c6d
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-3c99f80a26484c6dLaguerre’s theorem on differential operators [SP14] polytool ?
-
premise (sequence):
basis-map coefficients of Riordan array (1+2x,x(1+x)). shifted by x -> -x + 0
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
preserver_image reversal, shift 0
e-60aa79917842b999Affine, reversal and Möbius substitutions (elementary) polytool ?
-
premise (sequence):
basis-map coefficients of Riordan array (1+2x,x(1+x)). shifted by x -> -x + 0
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
basis_map A007318
e-c62e3171974f4f9cGeometric basis map (elementary) polytool ?
-
premise (sequence):
basis-map coefficients of Triangle read by rows: T(n,k) = binomial(k,n-k). shifted by x -> -x + 0
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
parent_provers periodic_product
e-5a4f04ff49b735c1root: theorem checkParent-row provers of polytool polytool ?
-
preserver_image mobius, shift 0
e-4adca88d3fcf673eAffine, reversal and Möbius substitutions (elementary) polytool ?
-
premise (sequence):
basis-map coefficients of Triangle read by rows: T(n,k) = binomial(k,n-k). shifted by x -> -x + 0
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
premise (sequence):
basis-map coefficients of Triangle read by rows: T(n,k) = binomial(k,n-k). shifted by x -> -x + 0
-
-
premise (sequence):
basis-map coefficients of Triangle read by rows: T(n,k) = binomial(k,n-k). shifted by x -> -x + 0
-
parent_provers periodic_product
e-c76ca1e6cd597d3broot: theorem checkParent-row provers of polytool polytool ?
-
preserver_image affine, shift 0
e-c58069640929a62bAffine, reversal and Möbius substitutions (elementary) polytool ?
-
premise (sequence):
basis-map coefficients of Triangle read by rows: T(n,k) = binomial(k,n-k). shifted by x -> -x + 0
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
premise (sequence):
basis-map coefficients of Triangle read by rows: T(n,k) = binomial(k,n-k). shifted by x -> -x + 0
-
-
premise (sequence):
basis-map coefficients of Riordan array (1+2x,x(1+x)). shifted by x -> -x + 0
-
↵ basis_map A007318
e-c62e3171974f4f9c(expanded above) -
↵ parent_provers periodic_product
e-c76ca1e6cd597d3b(expanded above) -
↵ preserver_image affine, shift 0
e-c58069640929a62b(expanded above)
-
-
premise (sequence):
basis-map coefficients of Riordan array (1+2x,x(1+x)). shifted by x -> -x + 0
Related sequences ?
Same fingerprint (59)
Equal up to content, sign, reversal and a small index shift.
- A007318 → ×(1+(3/2)n+(1/2)n²) → D
- basis-map coefficients of A026729 → basis A007318
- A344565 → D
- A085880 → basis A013609
- A007318 → ×(1+2n+n²) → D
- A007318: Binomial
- A028326 → basis A013609
- A038330 → basis A013611
- A135838 → basis A013609
- A129533: Array read by antidiagonals: T(n,k) = binomial(n+1,2)*binomial(n+k,n+1) for 0 <= k <= n.
- A135838: Triangle read by rows: T(n,k) = 2^floor(n/2)*binomial(n-1,k-1).
- A178822 → basis A013609
- basis-map coefficients of A021012 → x ↦ x+1
- A028326: Twice Pascal's triangle A007318: T(n,k) = 2*C(n,k).
- A028326 → D
- A178820 → basis A013609
- A156992: Triangle T(n,k) = n!*binomial(n-1, k-1) for 1 <= k <= n, read by rows.
- A038325 → basis A013609
- Riordan array (1-x,x/(1-x)).
- A135065: A127733 * A007318 as infinite lower triangular matrices.
- A010054 → reverse → x ↦ x+1
- A178822: Triangle read by rows: T(n,k) = C(n+5,5) * C(n,k), 0 <= 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…
- A003506: Triangle of denominators in Leibniz's Harmonic Triangle a(n,k), n >= 1, 1 <= k <= n.
- A027465 → basis A013611
- A196347: Triangle T(n, k) read by rows, T(n, k) = n!*binomial(n, k).
- A038338 → basis A013609
- basis-map coefficients of A113214, shifted → basis A013609
- A038221 → basis A013609
- A178822 → D
- basis-map coefficients of A026729, shifted → basis A007318
- basis-map coefficients of A112227 → x ↦ x+1
- A156992 → basis A013609
- A237765: Triangular array read by rows: T(n,k) = binomial(n,2)*binomial(n,k), n>=0, 0<=k<=n.
- A135838 → D
- A085881: Triangle T(n,k) read by rows: multiply row n of Pascal's triangle (A007318) by A001147(n).
- A120910 → basis A013610
- A085881 → basis A013609
- A094305: Triangle read by rows: T(n,k) = ((n+1)(n+2)/2) * binomial(n,k) (0 <= k <= n).
- A344565 → basis A013609
- A038208 → D
- A007318 → D → D
- A007318 → ×(−(1/2)n+(1/2)n²) → D
- A178820: Triangle read by rows: T(n,k) = C(n+3,3) * C(n,k), 0 <= k <= n.
- A216973: Exponential Riordan array [x*exp(x),x].
- A038208: Triangle whose (i,j)-th entry is binomial(i,j)*2^i.
- basis-map coefficients of Riordan array (1+2x,x(1+x)). shifted by x -> -x + 0
- A344565: Triangle read by rows, for 0 <= k <= n: T(n, k) = binomial(n, k) * binomial(binomial(n + 3, 2), 2).
- A038325: Triangle read by rows whose (i,j)-th entry is binomial(i,j)*11^(i-j)*11^j.
- A178821: Triangle read by rows: T(n,k) = binomial(n+4,4) * binomial(n,k), 0 <= k <= n.
- A178821 → basis A013609
- A038221: Triangle whose (i,j)-th entry is binomial(i,j)*3^(i-j)*3^j.
- Triangle whose (i,j)-th entry is binomial(i,j)*12^(i-j)*12^j.
- A178820 → D
- A196347 → basis A013609
- A178821 → D
- A356546: Triangle read by rows. T(n, k) = RisingFactorial(n + 1, n) / (k! * (n - k)!).
- A356546 → basis A013609
- A085880 → D
References
- [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.