OFFSET
1,2
COMMENTS
Numbers n such that gcd(n, 2^n - 1) = 1 and n is not a multiple of A002326((q - 1)/2), where q is a Wieferich prime A001220. - Thomas Ordowski, Nov 21 2015
If n is in the sequence, then so are all divisors of n. - Robert Israel, Nov 23 2015
LINKS
Max Alekseyev, Table of n, a(n) for n = 1..910
EXAMPLE
a(7) = 8 because 2^8 - 1 = 255 = 3 * 5 * 17 is squarefree.
MAPLE
N:= 400: # to get all terms <= N
# This relies on the fact that the first N+1 members of A000225 have all been factored
# without any further Wieferich primes being found.
V:= Vector(N, 1):
V[364 * [$1..N/364]]:= 0:
V[1755 * [$1..N/1755]]:= 0:
for n from 2 to N do
if V[n] = 0 then next fi;
if igcd(n, 2 &^n - 1 mod n) > 1 then
V[n * [$1..N/n]]:= 0
fi;
od:
select(t -> V[t] = 1, [$1..N]); # Robert Israel, Nov 23 2015
MATHEMATICA
Select[Range@ 92, SquareFreeQ[2^# - 1] &] (* Michael De Vlieger, Nov 21 2015 *)
PROG
(PARI) isok(n) = issquarefree(2^n - 1); \\ Michel Marcus, Dec 19 2013
(Magma) [n: n in [1..100] | IsSquarefree(2^n-1)]; // Vincenzo Librandi, Nov 22 2015
CROSSREFS
KEYWORD
nonn
AUTHOR
EXTENSIONS
Terms a(73)-a(910) in b-file from Max Alekseyev, Nov 15 2014, Sep 28 2015
STATUS
approved