OFFSET
1,1
COMMENTS
Thus a(n) is the least prime p for which p-1=phi(p), a totient value, multiplied by phi(p^n), another totient value, gives a nontotient. There are several instances of these numbers in A361058.
LINKS
Michel Marcus, Table of n, a(n) for n = 1..160
PROG
(PARI) a(n) = my(p=2); while (istotient((p-1)*eulerphi(p^n)), p = nextprime(p+1)); p;
CROSSREFS
KEYWORD
nonn
AUTHOR
Michel Marcus, May 29 2023
STATUS
approved