cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A133382 Numbers n such that gcd( n!-1, 2^n-1 ) is neither 1 nor 2n+1.

Original entry on oeis.org

75, 525, 3940
Offset: 1

Views

Author

M. F. Hasler, Oct 28 2007

Keywords

Comments

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?

Crossrefs

Programs

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