60722

Appears in sequences

• The number of divisors d of n! such that the symmetric group on n letters contains no elements of order d.at n=20A211392
• For any n > 0, if A006666(n) >= 0, then a(n) = Sum_{i = 0..A006666(n)-1} 2^i * [T^i(n) == 0 (mod 2)] (where [] is an Iverson bracket and T^i denotes the i-th iterate of the Collatz function A014682); otherwise a(n) = -1.at n=24A304715