A360114 Numbers k such that m^(1 + 2^v(k-1)) == -m (mod k) has only one solution (with 0 <= m < k), where v(k) = A007814(k) is the 2-adic valuation of k.

3, 5, 7, 9, 11, 13, 17, 19, 21, 23, 25, 27, 29, 31, 33, 37, 41, 43, 45, 47, 49, 53, 57, 59, 61, 63, 65, 67, 69, 71, 73, 77, 79, 81, 83, 89, 93, 97, 99, 101, 103, 105, 107, 109, 113, 117, 121, 125, 127, 129, 131, 133, 137, 139, 141, 145, 147, 149, 151, 157, 161, 163, 165, 167, 169, 171, 173, 177, 179

Offset: 1

Author

Antti Karttunen, Feb 10 2023

Keywords

• nonn

Crossrefs

Union of A065091 and A345330.

Cf. A007814, A360112, A360113 (characteristic function).

Programs

PARI

isA360114(n) = A360113(n);