[go: up one dir, main page]

login
Numbers k such that prime(k) == 14 (mod k).
5

%I #16 Feb 11 2021 22:56:12

%S 1,3,9,23,81,85,87,16057,4124457,27067011,27067127,1208198605,

%T 1208198851

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

%C Starting with a(4), positions of 14 in A004648. - _Robert G. Wilson v_, Feb 22 2006, 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] == 14, Print[n]], {n, 10^9}] (* _Robert G. Wilson v_ *)

%o (Sage)

%o def A116659(max) :

%o terms = []

%o p = 2

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

%o if (p - 14) % 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(9)-a(13) from _Robert G. Wilson v_, Feb 22 2006

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