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.

A023150 Numbers k such that prime(k) == 8 (mod k).

Original entry on oeis.org

1, 3, 17, 443, 2701, 100365, 637235, 637325, 4124455, 4124473, 4124587, 27067125, 27067137, 27067521, 8179002131, 8179002135, 8179002153, 55762149069, 382465573521, 6201265271239145, 6201265271240411, 43525513764814933, 43525513764815131, 43525513764816415
Offset: 1

Views

Author

Keywords

Crossrefs

Programs

  • Mathematica
    p = 1; Do[ If[ Mod[p = NextPrime[p], n] == 8, Print[n]], {n, 1, 10^9}] (* Robert G. Wilson v, Feb 18 2004 *)
  • Sage
    def A023150(max):
        terms = []
        p = 2
        for n in range(1, max+1) :
            if (p - 8) % n == 0 : terms.append(n)
            p = next_prime(p)
        return terms
    # Eric M. Schmidt, Feb 05 2013

Extensions

More terms from Robert G. Wilson v, Feb 18 2004
a(15)-a(18) from Robert G. Wilson v, Feb 22 2006
First two terms inserted by Eric M. Schmidt, Feb 05 2013
Terms a(19) and beyond from Giovanni Resta, Feb 23 2020