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!)
A116657 Numbers k such that prime(k) == 11 (mod k). 5

%I #21 Feb 11 2021 22:55:58

%S 1,2,3,4,5,8,20,38,39,82,190,192,444,2702,40079,40156,251719,251725,

%T 251733,251740,251788,637322,637342,10553424,10553571,10553575,

%U 10553646,10553824,27066990,69709708,69709870,69709881,69709941,179992918,179993010

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

%C Starting with a(7), positions of 11 in A004648. - corrected by _Eric M. Schmidt_, Feb 05 2013

%t NextPrim[n_] := Block[{k = n + 1}, While[ !PrimeQ[k], k++ ]; k]; p = 1; Do[ If[ Mod[p = NextPrim[p], n] == 11, Print[n]], {n, 10^9}] (* _Robert G. Wilson v_, Feb 22 2006 *)

%o (Sage)

%o def A116657(max) :

%o terms = []

%o p = 2

%o for n in range(1, max+1) :

%o if (p - 11) % n == 0 : terms.append(n)

%o p = next_prime(p)

%o return terms

%o # _Eric M. Schmidt_, Feb 05 2013

%Y Cf. A004648; A023143 - A023152, A116657, A116677, A116658, A116659: prime(n) == m (mod n), m=1..14.

%K nonn

%O 1,2

%A _Zak Seidov_, Feb 21 2006

%E a(17)-a(35) from _Robert G. Wilson v_, Feb 22 2006

%E First six terms inserted by _Eric M. Schmidt_, Feb 05 2013

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 April 16 04:38 EDT 2024. Contains 371696 sequences. (Running on oeis4.)