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.

A074380 Sarrus numbers n (A001567) which satisfy mu(n) = -1 and which are not Super-Poulet numbers (A050217).

Original entry on oeis.org

561, 645, 1105, 1729, 1905, 2465, 2821, 4371, 6601, 8481, 8911, 10585, 12801, 13741, 13981, 15841, 16705, 25761, 29341, 30121, 30889, 33153, 34945, 41665, 46657, 52633, 57421, 68101, 74665, 83665, 87249, 88561, 91001, 93961, 113201
Offset: 1

Views

Author

Jani Melik, Sep 24 2002

Keywords

Comments

Some of these are Carmichael numbers, A002997: 561, 1105, 1729, ....

Crossrefs

Programs

  • Mathematica
    Select[ Range[115000], !PrimeQ[ # ] && OddQ[ # ] && PowerMod[2, # - 1, # ] == 1 && Union[ PowerMod[2, Drop[Divisors[ # ], 1], # ]] != {2} && MoebiusMu[ # ] != 1 &]
  • PARI
    is(n)=if(isprime(n) || Mod(2,n)^(n-1)!=1 || moebius(n)>=0, return(0)); fordiv(n, d, if(Mod(2, d)^d!=2, return(1))); 0 \\ Charles R Greathouse IV, Sep 01 2016

Extensions

Edited and extended by Robert G. Wilson v, Oct 03 2002