preserver_image / hadamard_multiplier, shift -1
Image under a real-rootedness preserver. All operations
Parameters (20)
- all
- derivative_polynomial, shift 0 422 proof steps, 410 sequences
- euler_polynomial, shift 0 367 proof steps, 352 sequences
- affine, shift 0 333 proof steps, 318 sequences
- reversal, shift 0 169 proof steps, 164 sequences
- mobius, shift 0 160 proof steps, 160 sequences
- hadamard_multiplier, shift 0 5 proof steps, 5 sequences
- affine, shift -1 5 proof steps, 5 sequences
- reversal, shift 1 4 proof steps, 4 sequences
- affine, shift 1 4 proof steps, 4 sequences
- hadamard_multiplier, shift 2 3 proof steps, 3 sequences
- affine, shift 2 2 proof steps, 2 sequences
- euler_polynomial, shift 1 2 proof steps, 2 sequences
- hadamard_multiplier, shift -1 2 proof steps, 2 sequences
- derivative_of_power_multiple, shift 0 1 proof steps, 1 sequences
- derivative_of_power_multiple, shift 1 1 proof steps, 1 sequences
- derivative_polynomial, shift -1 1 proof steps, 1 sequences
- derivative_polynomial, shift 2 1 proof steps, 1 sequences
- euler_polynomial, shift 2 1 proof steps, 1 sequences
- hadamard_multiplier, shift 1 1 proof steps, 1 sequences
- reversal, shift -1 1 proof steps, 1 sequences
2 sequences
-
A089627: T(n,k) = binomial(n,2*k)*binomial(2*k,k) for 0 <= k <= n, triangle read by rows.
A059344 → ⊙ 1/k! (shift -1)1 · 1 · 1, 2 · 1, 6 … row sums 1, 1, 3, 7, 19, 51, 141, 393, …
-
A391045: Triangle read by rows: T(n,k) = binomial(n+1,k+1)*binomial(2*n-k+1,k)/(n+1), 0<=k<=n.
A172431 → ⊙ C(n,k+1) (shift -1)1 · 1, 1 · 1, 4, 1 · 1, 9, 10, 1 … row sums 1, 2, 6, 21, 80, 322, 1347, 5798, …