Numbers k such that 2^(k-1) == 1 + b*k (mod k^2), where b divides k - 2^p for some integer p >= 0 and 2^p <= b.

A186884

Numbers k such that 2^(k-1) == 1 + b*k (mod k^2), where b divides k - 2^p for some integer p >= 0 and 2^p <= b.