40061

Appears in sequences

• a(n) = Sum_{i=1..n-1} (2^i*C(i)-a(i)) * (2^(n-i)*C(n-i)-a(n-i)), a(1)=1, where C(i)=A000108(i-1) are Catalan numbers.at n=7A192481
• Least integer N > 2 such that the number of primes (<=N) <= the number of base-n-zero containing numbers (<=N).at n=25A306521
• (1/4) * number of ways to select 3 distinct points forming a triangle of unsigned area = n/2 from a square of grid points with side length n.at n=22A320310
• Number of compositions (ordered partitions) of n into heptagonal numbers (A000566).at n=49A322799