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.

A092050 Numbers n such that prime(n) == -8 (mod n).

Original entry on oeis.org

1, 63, 435, 100347, 100353, 100359, 637335, 129992911, 129993001, 129993007, 129993171, 8179002121, 8179002123, 8179002177, 382465573539
Offset: 1

Views

Author

Robert G. Wilson v, Feb 18 2004

Keywords

Comments

No more terms < 2*10^12. - David Wasserman, Jun 09 2005

Crossrefs

Programs

  • Mathematica
    NextPrim[n_] := Block[{k = n + 1}, While[ !PrimeQ[k], k++ ]; k]; p = 1; Do[ If[ Mod[p = NextPrim[p], n] == n - 8, Print[n]], {n, 1, 10^9}]

Extensions

Corrected by Mohammed Bouayoun (bouyao(AT)wanadoo.fr), Feb 20 2004
More terms from David Wasserman, Jun 09 2005