Numbers n such that each reduced Collatz trajectory (mod p): (n, T(n), T(T(n)), ..., 4, 2, 1) / pZ, where the odd prime p is the number of iterations needed to reach 1, contains exactly the p-1 values {1, 2, 3, ..., p-1}.

A267435

Numbers n such that each reduced Collatz trajectory (mod p): (n, T(n), T(T(n)), ..., 4, 2, 1) / pZ, where the odd prime p is the number of iterations needed to reach 1, contains exactly the p-1 values {1, 2, 3, ..., p-1}.

Terms

    a(0) =8a(1) =20a(2) =32a(3) =320a(4) =2048a(5) =2216a(6) =8192a(7) =13312a(8) =87040a(9) =218432a(10) =524288a(11) =89478400a(12) =536870912a(13) =137438953472

External references