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.

A022465 Numbers n such that prime(n) mod n <= 10.

Original entry on oeis.org

1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 21, 31, 32, 33, 34, 35, 36, 37, 69, 73, 74, 75, 76, 77, 78, 79, 80, 181, 191, 443, 445, 1052, 2701, 2703, 6455, 6456, 6457, 6459, 6460, 6466, 15928, 15929, 16055, 40073, 40078, 40080, 40081, 40082, 40083, 40122
Offset: 1

Views

Author

Keywords

Comments

a(96) > 5*10^6. - Robert Israel, Aug 29 2018

Crossrefs

Cf. A038624.

Programs

  • Maple
    Res:= NULL; p:= 1; count:= 0:
    for n from 1 while count < 80 do
      p:= nextprime(p);
      if p mod n <= 10 then count:=count+1; Res:= Res, n;
      fi
    od:
    Res; # Robert Israel, Aug 29 2018
  • Mathematica
    Select[Range[41000],Mod[Prime[#],#]<=10&] (* Harvey P. Dale, Aug 21 2011 *)

Extensions

More terms from David W. Wilson
More terms from Robert Israel, Aug 29 2018