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.

A204910 Least prime p such that n divides p-q for some prime q satisfying 5<=q

Original entry on oeis.org

7, 7, 11, 11, 17, 11, 19, 13, 23, 17, 29, 17, 31, 19, 37, 23, 41, 23, 43, 31, 47, 29, 53, 29, 61, 31, 59, 41, 71, 37, 67, 37, 71, 41, 83, 41, 79, 43, 83, 47, 89, 47, 97, 61, 97, 53, 101, 53, 103, 61, 107, 59, 113, 59, 127, 61, 127, 71, 131, 67, 127, 67, 131, 71, 137, 71, 139, 73, 149, 83, 149, 79
Offset: 1

Views

Author

Clark Kimberling, Jan 20 2012

Keywords

Comments

For a guide to related sequences, see A204892.

Crossrefs

Programs

  • Maple
    f:= proc(n) local p,k;
      p:= n+4;
      do
        p:= nextprime(p);
        if ormap(isprime, [seq(p-n*k,k=1..(p-5)/n)]) then return p fi
      od
    end proc:
    map(f, [$1..100]); # Robert Israel, Jun 27 2019
  • Mathematica
    (See the program at A204908.)

Extensions

More terms from Robert Israel, Jun 27 2019