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.

Previous Showing 11-11 of 11 results.

A092051 Numbers n such that prime(n) == -9 (mod n).

Original entry on oeis.org

1, 2, 4, 5, 17, 19, 20, 22, 23, 64, 1055, 1057, 6463, 251708, 251743, 251744, 251755, 251758, 27067054, 27067118, 27067138, 69709681, 69709703, 69709712, 145935689366, 382465573490, 382465573498, 6935812012621, 126979448983610, 885992692751476
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 - 9, Print[n]], {n, 1, 10^9}]

Extensions

Corrected by Mohammed Bouayoun (bouyao(AT)wanadoo.fr), Feb 20 2004
a(25) from Robert G. Wilson v, Feb 22 2006
Terms a(26) and beyond from Giovanni Resta, Feb 23 2020
Previous Showing 11-11 of 11 results.