login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A023144 Numbers k such that prime(k) == 2 (mod k). 18

%I #23 Jul 24 2021 08:36:33

%S 1,3,13,15,69,73,637321,27066989,27067095,27067133,179992909,

%T 1208198629,1208198853,8179002209,382465573515,2636913003191,

%U 18262325820323,18262325820339,6201265271239163,6201265271239191,6201265271239431,43525513764815041,43525513764815125

%N Numbers k such that prime(k) == 2 (mod k).

%C a(15) > 10^13. - _Charles R Greathouse IV_, Mar 17 2011

%H Giovanni Resta, <a href="/A023144/b023144.txt">Table of n, a(n) for n = 1..28</a> (terms < 3*10^20)

%t 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 Cf. A092044, A023143, A023145, A023146, A023147, A023148, A023149, A023150, A023151, A023152.

%Y Cf. A105290.

%K nonn

%O 1,2

%A _David W. Wilson_

%E More terms from _Robert G. Wilson v_, Feb 18 2004

%E a(10)-a(13) from _Giovanni Resta_ and _Robert G. Wilson v_, Feb 22 2006

%E Missing first term inserted by _M. F. Hasler_, Feb 04 2009

%E a(15)-a(23) from _Giovanni Resta_, Oct 02 2019

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 19 01:31 EDT 2024. Contains 374388 sequences. (Running on oeis4.)