cp's OEIS Frontend

A116677 Numbers k such that prime(k) == 12 (mod k).

%I A116677 #15 Feb 11 2021 22:56:28
%S A116677 1,91,4124467,27067043,27067229,27067261,27067523,1208198857,
%T A116677 8179002137,8179002191
%N A116677 Numbers k such that prime(k) == 12 (mod k).
%t A116677 NextPrim[n_] := Block[{k = n + 1}, While[ !PrimeQ[k], k++ ]; k]; p = 1; Do[ If[ Mod[p = NextPrim[p], n] == 12, Print[n]], {n, 10^9}]
%o A116677 (Sage)
%o A116677 def A116677(max) :
%o A116677     terms = []
%o A116677     p = 2
%o A116677     for n in range(1, max+1) :
%o A116677         if (p - 12) % n == 0 : terms.append(n)
%o A116677         p = next_prime(p)
%o A116677     return terms
%o A116677 # _Eric M. Schmidt_, Feb 05 2013
%Y A116677 Cf. A004648, A023143 - A023152, A116657, A116658, A116659: prime(n) == m (mod n), m=1..14.
%Y A116677 Cf. A116678.
%K A116677 nonn
%O A116677 1,2
%A A116677 _Giovanni Resta_ and _Robert G. Wilson v_, Feb 22 2006
%E A116677 First term inserted by _Eric M. Schmidt_, Feb 05 2013