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.

A023147 Numbers k such that prime(k) == 5 (mod k).

Original entry on oeis.org

1, 2, 3, 9, 16, 33, 40073, 40078, 40082, 40083, 40122, 251721, 251722, 251734, 251736, 4124584, 10553433, 10553439, 10553444, 10553454, 10553478, 10553552, 10553553, 10553818, 27067098, 27067524, 179992912, 465769814, 465769832, 465769839
Offset: 1

Views

Author

Keywords

Crossrefs

Programs

  • Mathematica
    p = 1; Do[ If[ Mod[p = NextPrime[p], n] == 5, Print[n]], {n, 1, 10^9}] (* Robert G. Wilson v, Feb 18 2004 *)

Extensions

More terms from Robert G. Wilson v, Feb 18 2004
a(24)-a(27) from Robert G. Wilson v, Feb 18 2004
Three missing initial terms at start of sequence inserted by Zak Seidov, Feb 05 2009