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.

A092045 Numbers n such that prime(n) == -3 (mod n).

Original entry on oeis.org

1, 2, 25, 26, 68, 1054, 1058, 6472, 251723, 4124468, 69709727, 69709942, 465769817, 465769835, 1208198860, 8179002154, 8179002176, 8179002178, 145935689360, 145935689369, 145935689392, 145935689393
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 - 3, Print[n]], {n, 1, 10^9}]
    Join[{1,2},Select[Range[5 10^6],Mod[Prime[#],#]==#-3&]] (* Harvey P. Dale, Mar 29 2023 *)

Extensions

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