1,1

Numbers n such that x^n==1 (mod n) has solutions 2<=x<=n - Benoit Cloitre, May 10 2002

Charles R Greathouse IV, Table of n, a(n) for n = 1..10000

a(n) = n + O(n/log log log n). - Charles R Greathouse IV, Apr 16 2012

(PARI) is(n)=gcd(n, eulerphi(n))>1 \\ Charles R Greathouse IV, Apr 16 2012

Complement of A003277.

Sequence in context: A117097 A077135 A110615 * A051234 A327776 A102554

Adjacent sequences: A060676 A060677 A060678 * A060680 A060681 A060682

nonn

Ahmed Fares (ahmedfares(AT)my-deja.com), Apr 19 2001

More terms from Vladeta Jovovic, Jul 05 2001

approved