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).

This page as a plain text file.
%I A092050 #4 Mar 31 2012 13:20:56
%S A092050 1,63,435,100347,100353,100359,637335,129992911,129993001,129993007,
%T A092050 129993171,8179002121,8179002123,8179002177,382465573539
%N A092050 Numbers n such that prime(n) == -8 (mod n).
%C A092050 No more terms < 2*10^12. - _David Wasserman_, Jun 09 2005
%t A092050 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}]
%Y A092050 Cf. A023150, A045924, A092044, A092045, A092046, A092047, A092048, A092049, A092051, A092052.
%K A092050 nonn
%O A092050 1,2
%A A092050 _Robert G. Wilson v_, Feb 18 2004
%E A092050 Corrected by Mohammed Bouayoun (bouyao(AT)wanadoo.fr), Feb 20 2004
%E A092050 More terms from _David Wasserman_, Jun 09 2005