preserver_image / euler_polynomial, 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
- affine, shift 1 4 proof steps, 4 sequences
- reversal, shift 1 4 proof steps, 4 sequences
- hadamard_multiplier, shift 2 3 proof steps, 3 sequences
- euler_polynomial, shift 1 2 proof steps, 2 sequences
- hadamard_multiplier, shift -1 2 proof steps, 2 sequences
- affine, shift 2 2 proof steps, 2 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
- derivative_of_power_multiple, shift 0 1 proof steps, 1 sequences
- derivative_of_power_multiple, shift 1 1 proof steps, 1 sequences
2 sequences
-
A069138: Triangle formed by multiplying Stirling numbers of 2nd kind S2(n,m) (A008277) by m+1.
A008277 → θ+2 (shift +1)2 · 2, 3 · 2, 9, 4 · 2, 21, 24, 5 … row sums 2, 5, 15, 52, 203, 877, 4140, 21147, …
-
A132812: Triangle read by rows, n>=1, 1<=k<=n, T(n,k) = k*binomial(n,k)^2/(n-k+1).
1 · 2, 2 · 3, 9, 3 · 4, 24, 24, 4 … row sums 1, 4, 15, 56, 210, 792, 3003, 11440, …