45750
domain: N
Appears in sequences
- Convolution of Catalan numbers and powers of -1.at n=11A032357
- Numbers k such that sopf(k) = sopf(k+2), where sopf(k) = A008472(k).at n=31A063968
- Numbers k such that 1*k + 1, 3*k + 1, 9*k + 1, 27*k + 1 are all primes.at n=35A112041
- Transform of Fibonacci(n+1) with Hankel transform (-1)^binomial(n+1,2) * Fibonacci(n+1).at n=25A156906
- Number of binary arrays indicating the locations of trailing edge maxima of a random length-n 0..6 array extended with zeros and convolved with -1,2,-1.at n=19A222041
- Partitions with subdiagonal growth: number of partitions (p0, p1, p2, ...) of n with pi - p0 <= i.at n=45A238876
- Triangle read by rows of coefficients of polynomials C_n(x) = Sum_{k=0..n} (2*k)!*(x - 1)^(n-k)/((k + 1)!*k!).at n=66A271453
- Number of multisets of exactly n nonempty binary words with a total of 2n letters such that no word has a majority of 0's.at n=10A292549
- a(n) = 3*(3*n+1)*(9*n+8)/2.at n=33A304504
- Square array A(n,k), n >= 1, k >= 1, read by antidiagonals, where column k is the expansion of e.g.f. log(Sum_{j>=0} k^binomial(j,2) * x^j/j!).at n=39A308460
- Number of multisets of exactly ten nonempty binary words with a total of n letters such that no word has a majority of 0's.at n=10A316411
- Primitive terms of A108569.at n=28A346277