167055
domain: N
Appears in sequences
- Number of consecutive runs of 3 odd nonprimes congruent to 1 mod 4 below 10^n.at n=7A093187
- a(n) = A143702(n)/2.at n=22A143703
- Numbers n that enter a cycle of greater length than that for any k < n in the iteration sequence s(0)=n, s(k+1) = s(k) + (-1)^k*d(s(k)), where d(n) is the number of divisors of n (A000005).at n=7A285004
- a(n) is the least number that enters a cycle of length 2n in the iteration sequence s(0)=n, s(k+1) = s(k) + (-1)^k*d(s(k)), where d(n) is the number of divisors of n (A000005).at n=9A288070