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.

A092048 Numbers n such that prime(n) == -6 (mod n).

Original entry on oeis.org

1, 439, 100349, 100361, 100363, 27066991, 27067117, 1208198633, 8179002133
Offset: 1

Views

Author

Robert G. Wilson v, Feb 18 2004

Keywords

Crossrefs

Programs

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

Extensions

Corrected by Mohammed Bouayoun (bouyao(AT)wanadoo.fr), Feb 20 2004
a(8)-a(9) from Robert G. Wilson v, Feb 22 2006