46389

Appears in sequences

• a(n) = number of special even permutations of 2*n+1.at n=5A003109
• Sum_{i=0..2*A053645(n)} (C(2*A053645(n),i) mod 2)*A000045(n-i) [where C(r,c) is the binomial coefficient (A007318) and A000045(n) is the n-th Fibonacci number].at n=24A075149
• Limit number of (m-n)-almost-primes in range [2^m..2^{m+1}-1].at n=13A092097
• Third row of array in A101385.at n=8A101645
• Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, -1, 1), (0, 0, 1), (0, 1, -1), (1, 0, -1)}.at n=11A148503
• Number of numbers in row n of the array at A243855.at n=24A243856
• Triangle read by rows: T(n,k) = number of topologies on an n-set X such that there are exactly k elements in X that are topologically distinguishable, n >= 0, 0 <= k <= n.at n=30A280192
• Numbers k such that (14*10^k - 53) / 3 is prime.at n=25A280206