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.

A080747 Sarrus numbers with more than 2 distinct prime factors.

Original entry on oeis.org

561, 645, 1105, 1729, 1905, 2465, 2821, 4371, 6601, 8481, 8911, 10585, 11305, 12801, 13741, 13981, 15841, 16705, 18705, 23001, 25761, 29341, 30121, 30889, 33153, 34945, 39865, 41041, 41665, 46657, 52633, 55245, 57421, 62745, 63973, 68101, 72885, 74665, 75361
Offset: 1

Views

Author

Benoit Cloitre, Mar 08 2003

Keywords

Crossrefs

Cf. A001567.

Programs

  • Maple
    for n from 1 to 60000 do if not isprime(n) and modp(2^(n-1),n)=1 and nops(ifactors(n)[2])>2 then printf("%d, ",n) fi od: # C. Ronaldo
  • Mathematica
    Select[Range[76000], PowerMod[2, #-1, #] == 1 && PrimeNu[#] > 2 &] (* Giovanni Resta, Aug 20 2018 *)

Extensions

Edited by C. Ronaldo (aga_new_ac(AT)hotmail.com), Dec 19 2004
More terms from Giovanni Resta, Aug 20 2018