login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A068480 Numbers n such that gcd(n!-1,2^n+1)>1. 5
1, 29, 41, 53, 69, 105, 125, 141, 153, 165, 189, 233, 249, 273, 293, 321, 329, 405, 413, 429, 441, 453, 485, 581, 585, 629, 641, 653, 713, 729, 741, 761, 765, 809, 813, 849, 893, 905, 989, 993, 1005, 1013, 1041, 1049, 1089, 1121, 1125, 1133, 1169, 1205 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

G. C. Greubel, Table of n, a(n) for n = 1..1000

MAPLE

select(n->gcd(factorial(n)-1, 2^n+1)>1, [$1..1230]); # Muniru A Asiru, Oct 16 2018

MATHEMATICA

Select[Range[2500], GCD[#! - 1, 2^# + 1] > 1 &] (* G. C. Greubel, Oct 15 2018 *)

PROG

(PARI) isok(n) = gcd(n!-1, 2^n+1) > 1; \\ Michel Marcus, Oct 16 2018

(GAP) Filtered([1..1230], n->Gcd(Factorial(n)-1, 2^n+1)>1); # Muniru A Asiru, Oct 16 2018

CROSSREFS

Cf. A000051 (2^n+1), A033312 (n!-1).

Cf. A068481, A068482, A068483.

Sequence in context: A229059 A330653 A125516 * A161616 A069454 A035789

Adjacent sequences:  A068477 A068478 A068479 * A068481 A068482 A068483

KEYWORD

nonn

AUTHOR

Benoit Cloitre, Mar 10 2002

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 29 17:41 EDT 2021. Contains 346346 sequences. (Running on oeis4.)