cp's OEIS Frontend

A116657 Numbers k such that prime(k) == 11 (mod k).

%I A116657 #21 Feb 11 2021 22:55:58
%S A116657 1,2,3,4,5,8,20,38,39,82,190,192,444,2702,40079,40156,251719,251725,
%T A116657 251733,251740,251788,637322,637342,10553424,10553571,10553575,
%U A116657 10553646,10553824,27066990,69709708,69709870,69709881,69709941,179992918,179993010
%N A116657 Numbers k such that prime(k) == 11 (mod k).
%C A116657 Starting with a(7), positions of 11 in A004648. - corrected by _Eric M. Schmidt_, Feb 05 2013
%t A116657 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 A116657 (Sage)
%o A116657 def A116657(max) :
%o A116657     terms = []
%o A116657     p = 2
%o A116657     for n in range(1, max+1) :
%o A116657         if (p - 11) % n == 0 : terms.append(n)
%o A116657         p = next_prime(p)
%o A116657     return terms
%o A116657 # _Eric M. Schmidt_, Feb 05 2013
%Y A116657 Cf. A004648; A023143 - A023152, A116657, A116677, A116658, A116659: prime(n) == m (mod n), m=1..14.
%K A116657 nonn
%O A116657 1,2
%A A116657 _Zak Seidov_, Feb 21 2006
%E A116657 a(17)-a(35) from _Robert G. Wilson v_, Feb 22 2006
%E A116657 First six terms inserted by _Eric M. Schmidt_, Feb 05 2013