25755
domain: N
Appears in sequences
- a(n) = (1/C(n,0) - 1/C(n,1) + ... + d/C(n,k))*L, where d = (-1)^k,k = [ n/2 ], L = LCM{C(n,0), C(n,1),..., C(n,n)}.at n=12A025536
- Riordan array (1/(1 + 5*x + x^2), x/(1 + 5*x + x^2))^(-1); inverse of Riordan array A123967.at n=21A125906
- Numbers k such that 3k-4, 3k-2, 3k+2, and 3k+4 are primes.at n=31A173092
- Numbers m such that m*reversal(m) contains every decimal digit exactly once.at n=12A178929
- Number of paths from (0,0) to (n,0), never going below the x-axis, using steps U=(1,1), H=(1,0) and D=(1,-1), where the H steps come in five colors.at n=6A182401
- Odd numbers that are not of the form p + 2^a + 2^b with b > a > 0, and p prime.at n=7A268693