login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A068482 Numbers n such that gcd(n!+1,2^n-1)>1. 4

%I #16 Oct 16 2018 20:09:35

%S 2,3,4,6,10,12,16,18,22,23,28,30,36,39,40,42,46,51,52,58,60,63,66,70,

%T 72,78,82,88,95,96,99,100,102,106,108,112,126,130,131,135,136,138,148,

%U 150,156,162,166,172,178,180,183,190,191,192,196,198,210,215,222,226

%N Numbers n such that gcd(n!+1,2^n-1)>1.

%C If n=p-1, p prime, then n is in the sequence.

%H G. C. Greubel, <a href="/A068482/b068482.txt">Table of n, a(n) for n = 1..1000</a>

%p select(n->gcd(factorial(n)+1,2^n-1)>1,[$1..230]); # _Muniru A Asiru_, Oct 16 2018

%t Select[Range[300],GCD[#!+1,2^#-1]>1&] (* _Harvey P. Dale_, Jan 31 2015 *)

%o (PARI) isok(n) = gcd(n!+1,2^n-1) > 1; \\ _Michel Marcus_, Oct 16 2018

%o (GAP) Filtered([1..230],n->Gcd(Factorial(n)+1,2^n-1)>1); # _Muniru A Asiru_, Oct 16 2018

%Y Cf. A000225 (2^n-1), A038507 (n!+1).

%Y Cf. A068480, A068481, A068483.

%K easy,nonn

%O 1,1

%A _Benoit Cloitre_, Mar 10 2002

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 28 10:55 EDT 2024. Contains 371241 sequences. (Running on oeis4.)