Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
%I #13 Nov 01 2021 00:55:45
%S 2,3,31,43,112643
%N Unsafe primes (primes in A059456) for which there is exactly one divisor d of p - 1 such that o(d) = L(p), where o(k) is the multiplicative order of k modulo p and L(p) is the least common multiple of o(k)'s among all divisors k of p - 1.
%C a(6) > 10^12, if it exists.
%C If a prime p = 2ab + 1 with a, b prime belongs to this sequence, then o(k) is a permutation over divisors of p - 1.
%C If a prime p = 2q + 1 is a safe prime (in A005385), then we have either o(2) = 2q, o(q) = q or o(2) = q, o(q) = 2q. Thus there is exactly one divisor d of p - 1 such that o(d) = L(p) = 2q.
%H Peter Fletcher and Camron Withrow, <a href="http://math.colgate.edu/~integers/t61/t61.mail.html">Primes p Having at Most One Divisor of p-1 of a Specified Multiplicative Order</a>, Integers 19 (2019), Article #A61. Only considers terms > 3.
%e For p = 31, then o(2) = 5, o(3) = 30, o(5) = 3, o(6) = 6, o(10) = 15, o(15) = 10, and o(30) = 2; so 31 is a term.
%o (PARI) isunsafe(p) = isprime(p) && !isprime(p\2); \\ A059456
%o isok(p) = {if (isunsafe(p), my(vd=divisors(p-1), L = lcm(vd)); sum(k=1, #vd, znorder(Mod(vd[k], p)) == L) == 1;);} \\ _Michel Marcus_, Aug 27 2021
%Y Cf. A005385, A059456.
%K nonn,hard,more
%O 1,1
%A _Tomohiro Yamada_, Aug 27 2021