184097domain: NAppears in sequencesNumbers k such that Sum_{i=1..k} (i-tau(i))^i == 0 (mod k), where tau(i) = A000005(i), the number of divisors of i, and i-tau(i) = A049820(i).at n=12A229210Odd numbers n containing 16384 as the highest power of 2 in the Collatz (3x+1) iteration.at n=12A247715