864864

Appears in sequences

• a(n) = smallest k such that A141501(k) = 2*n+1.at n=29A143474
• Number of undirected labeled graphs on n nodes with exactly 10 cycle graphs as connected components.at n=4A215770
• Number of undirected labeled graphs on n+4 nodes with exactly n cycle graphs as connected components.at n=10A215774
• Numbers other than prime powers divisible by the sum and the sum of squares of their prime divisors.at n=27A268417
• Triangle of coefficients c(n,i), 1<=i<=n, such that for each n>=2, c(n,i) are setwise coprime; and for all primes p>2n-1, the sum of (-1)^i*c(n,i)*binomial(i*p,p) is divisible by p^(2n-1).at n=37A268512
• a(n) is the smallest number that has exactly n divisors that are cyclops numbers (A134808).at n=18A357033