A360114 - cp's OEIS frontend

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.

%I A360114 #6 Feb 10 2023 17:11:16
%S A360114 3,5,7,9,11,13,17,19,21,23,25,27,29,31,33,37,41,43,45,47,49,53,57,59,
%T A360114 61,63,65,67,69,71,73,77,79,81,83,89,93,97,99,101,103,105,107,109,113,
%U A360114 117,121,125,127,129,131,133,137,139,141,145,147,149,151,157,161,163,165,167,169,171,173,177,179
%N 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.
%o A360114 (PARI) isA360114(n) = A360113(n);
%Y A360114 Union of A065091 and A345330.
%Y A360114 Cf. A007814, A360112, A360113 (characteristic function).
%K A360114 nonn
%O A360114 1,1
%A A360114 _Antti Karttunen_, Feb 10 2023

cp's OEIS Frontend

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.