62325

Appears in sequences

• Triangle read by rows: T(n, k) = (-2)^k*binomial(n, k)*Euler(k, 1/2).at n=63A081658
• Triangle, read by rows, of numbers T(n,k), 0 <= k <= n, given by T(n,k) = A000364(n-k)*binomial(2*n, 2*k).at n=16A086646
• Duplicate of A086646.at n=16A086745
• Triangle read by rows, T(n,k) = binomial(n,k)*A000111(n-k), 0 <= k <= n.at n=57A109449
• Exponential Riordan array (sech(x),x).at n=57A119879
• Nonzero coefficients of the Swiss-Knife polynomials for the computation of Euler, tangent, and Bernoulli numbers (triangle read by rows).at n=34A153641
• Matrix inverse of A162169.at n=57A162170
• Third column of A162170.at n=8A162171
• Number of 0..3 integer arrays v[1..n] of length n with all autocorrelation values sum(i){v[i]*v[i-k]} distinct for k in 0..n-1.at n=8A171309
• Number of 0..n-1 integer arrays v[1..9] of length 9 with all autocorrelation values sum(i){v[i]*v[i-k]} distinct for k in 0..8.at n=3A171360
• Triangular array read by rows. T(n,k) is the number of alternating permutations of [2n+1] having exactly 2k elements to the left of 1, n >= 0, 0 <= k <= n.at n=16A362582
• Triangular array read by rows. T(n,k) is the number of alternating permutations of [2n+1] having exactly 2k elements to the left of 1, n >= 0, 0 <= k <= n.at n=19A362582