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.

A092046 Numbers n such that prime(n) == -4 (mod n).

This page as a plain text file.
%I A092046 #6 Jul 14 2012 11:40:50
%S A092046 1,3,5,7,9,67,441,2615,637237,637329,4124703,27067119,179993017,
%T A092046 1208198617,8179002101,55762149071,55762149091
%N A092046 Numbers n such that prime(n) == -4 (mod n).
%t A092046 NextPrim[n_] := Block[{k = n + 1}, While[ !PrimeQ[k], k++ ]; k]; p = 1; Do[ If[ Mod[p = NextPrim[p], n] == n - 4, Print[n]], {n, 1, 10^9}]
%Y A092046 Cf. A023146, A045924, A092044, A092045, A092047, A092048, A092049, A092050, A092051, A092052.
%K A092046 nonn
%O A092046 1,2
%A A092046 _Robert G. Wilson v_, Feb 18 2004
%E A092046 Corrected by Mohammed Bouayoun (bouyao(AT)wanadoo.fr), Feb 20 2004
%E A092046 a(13)-a(17) from _Robert G. Wilson v_, Feb 22 2006