|
%I #12 Dec 25 2015 00:02:26
%S 72,92,128,132,156,166,228,246,281,282,386,417,507,519,619,620,640,
%T 641,661,712,738,739,759,801,853,898,915,1000,1077,1152,1241,1246,
%U 1273,1289,1297,1364,1389,1421,1489,1493,1525,1543,1564,1632,1691,1699,1729
%N Numbers n such that gcd(prime(n+1) + 1, prime(n) + 1) = 8.
%H Harry J. Smith, <a href="/A066943/b066943.txt">Table of n, a(n) for n = 1..1000</a>
%t Select[ Range[120], GCD[ Prime[ # + 1] + 1, Prime[ # ] + 1] == 8 & ]
%o (PARI) { n=0; for (m=1, 10^10, if (gcd(prime(m+1) + 1, prime(m) + 1) == 8, write("b066943.txt", n++, " ", m); if (n==1000, return)) ) } \\ _Harry J. Smith_, Apr 10 2010
%Y Cf. A066940, A066941, A066942, A066944, A067603, A067604.
%K nonn
%O 1,1
%A _Benoit Cloitre_, Jan 24 2002
%E Edited by _Robert G. Wilson v_, Feb 01 2002
|
