preserver_image / reversal, shift 0
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
164 sequences
-
A100861: Triangle of Bessel numbers read by rows: T(n,k) is the number of k-matchings of the complete graph K(n).
1 · 1 · 1, 1 · 1, 3 … row sums 1, 1, 2, 4, 10, 26, 76, 232, …
-
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, …
-
A121574 → reverse
1 · 1, 2 · 1, 5, 4 · 1, 8, 16, 8 … row sums 1, 3, 10, 33, 109, 360, 1189, 3927, …
-
A237765: Triangular array read by rows: T(n,k) = binomial(n,2)*binomial(n,k), n>=0, 0<=k<=n.
A007318 → ×(−(1/2)n+(1/2)n²)1, 2, 1 · 3, 9, 9, 3 · 6, 24, 36, 24, 6 … row sums 0, 0, 4, 24, 96, 320, 960, 2688, …
-
A059473 → γ
1 · 2 · 4, 2 · 8, 8 … row sums 1, 2, 6, 16, 44, 120, 328, 896, …
-
A172431 → reverse
1 · 2, 1 · 3, 4, 1 · 4, 10, 6, 1 … row sums 1, 3, 8, 21, 55, 144, 377, 987, …
-
A135838: Triangle read by rows: T(n,k) = 2^floor(n/2)*binomial(n-1,k-1).
1 · 2, 2 · 2, 4, 2 · 4, 12, 12, 4 … row sums 1, 4, 8, 32, 64, 256, 512, 2048, …
-
A178820: Triangle read by rows: T(n,k) = C(n+3,3) * C(n,k), 0 <= k <= n.
1 · 4, 4 · 10, 20, 10 · 20, 60, 60, 20 … row sums 1, 8, 40, 160, 560, 1792, 5376, 15360, …
-
A008277 → θ+2 (shift +1) → reverse
2 · 3, 2 · 4, 9, 2 · 5, 24, 21, 2 … row sums 2, 5, 15, 52, 203, 877, 4140, 21147, …
-
A085880: Triangle T(n,k) read by rows: multiply row n of Pascal's triangle (A007318) by the n-th Catalan number (A000108).
1 · 1, 1 · 2, 4, 2 · 5, 15, 15, 5 … row sums 1, 2, 8, 40, 224, 1344, 8448, 54912, …
-
A132393 → reverse
1 · 1 · 1, 1 · 1, 3, 2 … row sums 1, 1, 2, 6, 24, 120, 720, 5040, …
-
A111910: Square array read by antidiagonals: S(p,q) = (p+q+1)!(2p+2q+1)!/((p+1)!(2p+1)!(q+1)!(2q+1)!) (p,q>=0).
A091044 → ⊙ C(n+2,k+1)1 · 1, 1 · 1, 5, 1 · 1, 14, 14, 1 … row sums 1, 2, 7, 30, 146, 772, 4331, 25398, …
-
A038207: Triangle whose (i,j)-th entry is binomial(i,j)*2^(i-j).
1 · 2, 1 · 4, 4, 1 · 8, 12, 6, 1 … row sums 1, 3, 9, 27, 81, 243, 729, 2187, …
-
A008459: Square the entries of Pascal's triangle.
1 · 1, 1 · 1, 4, 1 · 1, 9, 9, 1 … row sums 1, 2, 6, 20, 70, 252, 924, 3432, …
-
A272866: 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.
1 · 1, 3, 1 · 1, 6, 11, 6, 1 · 1, 9, 30, 45, 30, 9, 1 … row sums 1, 5, 25, 125, 625, 3125, 15625, 78125, …
-
A113953: A Jacobsthal triangle.
1 · 0, 1 · 0, 2, 1 · 0, 0, 4, 1 … row sums 1, 1, 3, 5, 11, 21, 43, 85, …
-
A145597: Generalized Narayana numbers, T(n, k) = 3/(n + 1)*binomial(n + 1, k + 2)*binomial(n + 1, k - 1), triangular array read by rows.
1 · 3, 3 · 6, 15, 6 · 10, 45, 45, 10 … row sums 1, 6, 27, 110, 429, 1638, 6188, 23256, …
-
A010054 → reverse → reverse
1 · 4 · 7 · 10 … row sums 1, 4, 7, 10, 13, 16, 19, 22, …
-
A007318 → 2θ+1 → reverse
1 · 3, 1 · 5, 6, 1 · 7, 15, 9, 1 … row sums 1, 4, 12, 32, 80, 192, 448, 1024, …
-
A001263: Triangle of Narayana numbers T(n,k) = C(n-1,k-1)*C(n,k-1)/k with 1 <= k <= n, read by rows. Also called the Catalan triangle.
1 · 1, 1 · 1, 3, 1 · 1, 6, 6, 1 … row sums 1, 2, 5, 14, 42, 132, 429, 1430, …
-
A114656 → reverse
1 · 1, 2 · 1, 6, 4 · 1, 12, 24, 8 … row sums 1, 3, 11, 45, 197, 903, 4279, 20793, …
-
A125662 → reverse
1 · 1, 3 · 1, 6, 8 · 1, 9, 25, 21 … row sums 1, 4, 15, 56, 209, 780, 2911, 10864, …
-
A126351 → reverse
1 · 2, 1 · 4, 5, 1 · 8, 19, 9, 1 … row sums 1, 3, 10, 37, 151, 674, 3263, 17007, …
-
basis-map coefficients of A026729, shifted → reverse
1 · -1 · 1 · -1 … row sums 1, -1, 1, -1, 1, -1, 1, -1, …
-
A108838 → reverse
2 · 2, 3 · 2, 8, 4 · 2, 15, 20, 5 … row sums 2, 5, 14, 42, 132, 429, 1430, 4862, …
-
A023531 → basis A049020 → reverse
1 · 1, 1 · 1, 3, 2 · 1, 6, 10, 5 … row sums 1, 2, 6, 22, 94, 454, 2430, 14214, …
-
A052553: Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by upward antidiagonals.
1 · 1 · 1, 1 · 1, 2 … row sums 1, 1, 2, 3, 5, 8, 13, 21, …
-
A007318: Binomial
1 · 1, 1 · 1, 2, 1 · 1, 3, 3, 1 … row sums 1, 2, 4, 8, 16, 32, 64, 128, …
-
A143494 → reverse
1 · 1, 2 · 1, 5, 4 · 1, 9, 19, 8 … row sums 1, 3, 10, 37, 151, 674, 3263, 17007, …
-
A046716: Coefficients of a special case of Poisson-Charlier polynomials.
1 · 1, 1 · 1, 3, 1 · 1, 6, 8, 1 … row sums 1, 2, 5, 16, 65, 326, 1957, 13700, …
-
A131431: 3n + 1 preceded by n zeros.
A010054 → reverse1 · 0, 4 · 0, 0, 7 · 0, 0, 0, 10 … row sums 1, 4, 7, 10, 13, 16, 19, 22, …
-
A123519 → reverse
4, 6, 1 · 8, 20, 12, 1 · 16, 56, 60, 20, 1 … row sums 11, 41, 153, 571, 2131, 7953, 29681, …
-
A038208: Triangle whose (i,j)-th entry is binomial(i,j)*2^i.
1 · 2, 2 · 4, 8, 4 · 8, 24, 24, 8 … row sums 1, 4, 16, 64, 256, 1024, 4096, 16384, …
-
A127733: Triangle read by rows: n-th row is n^2 preceded by (n-1) zeros.
A023531 → (θ+1)²1 · 0, 4 · 0, 0, 9 · 0, 0, 0, 16 … row sums 1, 4, 9, 16, 25, 36, 49, 64, …
-
A116412: Riordan array ((1+x)/(1-2x),x(1+x)/(1-2x)).
1 · 3, 1 · 6, 6, 1 · 12, 21, 9, 1 … row sums 1, 4, 13, 43, 142, 469, 1549, 5116, …
-
A131689 → reverse
1 · 1 · 2, 1 · 6, 6, 1 … row sums 1, 1, 3, 13, 75, 541, 4683, 47293, …
-
A127648: Triangle read by rows: row n consists of n zeros followed by n+1.
A010054 → reverse1 · 0, 2 · 0, 0, 3 · 0, 0, 0, 4 … row sums 1, 2, 3, 4, 5, 6, 7, 8, …
-
A085478 → reverse
1 · 1, 1 · 1, 3, 1 · 1, 5, 6, 1 … row sums 1, 2, 5, 13, 34, 89, 233, 610, …
-
A081578: Pascal-(1,3,1) array.
1 · 1, 1 · 1, 5, 1 · 1, 9, 9, 1 … row sums 1, 2, 7, 20, 61, 182, 547, 1640, …
-
A039756 → reverse
1 · 1, 1 · 1, 4, 1 · 1, 13, 9, 1 … row sums 1, 2, 6, 24, 116, 648, 4088, 28640, …
-
A007318 → D → γ
1 · 2 · 3 · 4 … row sums 1, 2, 3, 4, 5, 6, 7, 8, …
-
A344565: Triangle read by rows, for 0 <= k <= n: T(n, k) = binomial(n, k) * binomial(binomial(n + 3, 2), 2).
3 · 15, 15 · 45, 90, 45 · 105, 315, 315, 105 … row sums 3, 30, 180, 840, 3360, 12096, 40320, …
-
delannoy
1 · 1, 1 · 1, 3, 1 · 1, 5, 5, 1 … row sums 1, 2, 5, 12, 29, 70, 169, 408, …
-
A128099: Triangle read by rows: T(n,k) is the number of ways to tile a 3 X n rectangle with k pieces of 2 X 2 tiles and 3n-4k pieces of 1 X 1 tiles (0 <= k <= floor(n/2)).
1 · 1 · 1, 2 · 1, 4 … row sums 1, 1, 3, 5, 11, 21, 43, 85, …
-
A249251: Triangular array: row n gives the coefficients of the polynomial p(n,x) defined in Comments.
1 · 1, 3 · 1, 6, 6 · 1, 9, 21, 12 … row sums 1, 4, 13, 43, 142, 469, 1549, 5116, …
-
A207607 → reverse
1 · 2, 1 · 2, 5, 1 · 2, 9, 9, 1 … row sums 1, 3, 8, 21, 55, 144, 377, 987, …
-
A133080 → reverse
1 · 1, 1 · 1 · 1, 1 … row sums 1, 2, 1, 2, 1, 2, 1, 2, …
-
A023531 → (θ+1)² → reverse
1 · 4 · 9 · 16 … row sums 1, 4, 9, 16, 25, 36, 49, 64, …
-
A122542 → reverse
1 · 1 · 1, 2 · 1, 4, 2 … row sums 1, 1, 3, 7, 17, 41, 99, 239, …
-
A081579: Pascal-(1,4,1) array.
1 · 1, 1 · 1, 6, 1 · 1, 11, 11, 1 … row sums 1, 2, 8, 24, 80, 256, 832, 2688, …