Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A133382
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A133382 Numbers n such that gcd( n!-1, 2^n-1 ) is neither 1 nor 2n+1. +0
1
75, 525, 3940 (list; graph; listen)
OFFSET

1,1

COMMENT

This subsequence of A068483 lists the rare exceptions for which gcd( N!, 2^N-1 ) <> 2N+1. Is it finite? Are all elements multiples of 5?

PROGRAM

(PARI) for(n=1, 10^5, if((g=gcd(n!-1, 2^n-1)-1) & g!=2*n, print(n", ")))

CROSSREFS

Cf. A068483, A068480.

Adjacent sequences: A133379 A133380 A133381 this_sequence A133383 A133384 A133385

Sequence in context: A055561 A015223 A129625 this_sequence A017791 A017738 A166725

KEYWORD

nonn,bref

AUTHOR

M. F. Hasler (Maximilian.Hasler(AT)gmail.com), Oct 28 2007

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 8 20:39 EST 2009. Contains 166234 sequences.


AT&T Labs Research