OFFSET
1,1
COMMENTS
Numbers m such that prime(m)^2 == 1 mod (prime(m) + prime(m + 1)). - Zak Seidov, Sep 18 2013
LINKS
Robert G. Wilson v, Table of n, a(n) for n = 1..86027
FORMULA
a(n) = A107770(n) - 1. - Juri-Stepan Gerasimov, Dec 16 2009
MAPLE
A029707 := proc(n)
numtheory[pi](A001359(n)) ;
end proc:
seq(A029707(n), n=1..30); # R. J. Mathar, Feb 19 2017
MATHEMATICA
Select[ Range@300, PrimeQ[ Prime@# + 2] &] (* Robert G. Wilson v, Mar 11 2007 *)
Flatten[Position[Flatten[Differences/@Partition[Prime[Range[100]], 2, 1]], 2]](* Harvey P. Dale, Jun 05 2014 *)
PROG
(Sage)
def A029707(n) :
a = [ ]
for i in (1..n) :
if (nth_prime(i+1)-nth_prime(i) == 2) :
a.append(i)
return(a)
A029707(277) # Jani Melik, May 15 2014
CROSSREFS
KEYWORD
nonn
AUTHOR
N. J. A. Sloane, Dec 11 1999
STATUS
approved