367080

Appears in sequences

• Number of nonempty subsets of {1,2,...,n} in which exactly 3/5 of the elements are <= n/3.at n=27A047200
• Number of nonempty subsets of {1,2,...,n} in which exactly 3/5 of the elements are <= (n-1)/3.at n=27A048012
• Number of nonempty subsets of {1,2,...,n} in which exactly 3/5 of the elements are <= (n+1)/3.at n=27A048045
• Integers x such that for some integer y we have uphi(x) = uphi(y) = x-y, where uphi(n) = A047994(n) is the unitary totient function: If n = Product p_i^e_i, uphi(n) = Product (p_i^e_i - 1).at n=26A067739
• a(n) is the smallest m such that m*(m+1) is divisible by the first n prime numbers.at n=8A118478
• Smallest m such that the n-th odd prime is the smallest number coprime to m and m+1.at n=8A179675
• Numbers with prime factorization p*q*r*s*t*u^3 (where p, q, r, s, t, u are distinct primes).at n=18A190378
• Numbers n such that the multiplicative group modulo n is the direct product of 7 cyclic groups.at n=20A272597
• Square array A(n,k) (n>=1, k>=1) read by antidiagonals: A(n,k) is the number of n-colorings of the prism graph Y_k on 2k vertices.at n=40A277443