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.

A023144 Numbers k such that prime(k) == 2 (mod k).

This page as a plain text file.
%I A023144 #23 Jul 24 2021 08:36:33
%S A023144 1,3,13,15,69,73,637321,27066989,27067095,27067133,179992909,
%T A023144 1208198629,1208198853,8179002209,382465573515,2636913003191,
%U A023144 18262325820323,18262325820339,6201265271239163,6201265271239191,6201265271239431,43525513764815041,43525513764815125
%N A023144 Numbers k such that prime(k) == 2 (mod k).
%C A023144 a(15) > 10^13. - _Charles R Greathouse IV_, Mar 17 2011
%H A023144 Giovanni Resta, <a href="/A023144/b023144.txt">Table of n, a(n) for n = 1..28</a> (terms < 3*10^20)
%t A023144 NextPrim[n_] := Block[{k = n + 1}, While[ !PrimeQ[k], k++ ]; k]; p = 1; Do[ If[ Mod[p = NextPrim[p], n] == 2, Print[n]], {n, 1, 10^9}] (* _Robert G. Wilson v_, Feb 18 2004 *)
%Y A023144 Cf. A092044, A023143, A023145, A023146, A023147, A023148, A023149, A023150, A023151, A023152.
%Y A023144 Cf. A105290.
%K A023144 nonn
%O A023144 1,2
%A A023144 _David W. Wilson_
%E A023144 More terms from _Robert G. Wilson v_, Feb 18 2004
%E A023144 a(10)-a(13) from _Giovanni Resta_ and _Robert G. Wilson v_, Feb 22 2006
%E A023144 Missing first term inserted by _M. F. Hasler_, Feb 04 2009
%E A023144 a(15)-a(23) from _Giovanni Resta_, Oct 02 2019