3,4

(PARI) twtotwp2(n, n2, k) = { local(x, y, x2, c); c=0; forprime(x=n, n2, x2=x+2; y=x^x2+k; if(y%x2==0&!isprime(x2), c++; print1(x+2", "); ); ); print(); print(c", "pitwin(n2)) } pitwins(n) = \The number of twin prime pairs <= n. { local(c, x); c=0; forprime(x=3, n, if(isprime(x+2), c++) ); return(c) }

Sequence in context: A057246 A154895 A074849 this_sequence A156927 A164274 A047923

Adjacent sequences: A100871 A100872 A100873 this_sequence A100875 A100876 A100877

hard,more,nonn

Cino Hilliard (hillcino368(AT)gmail.com), Jan 09 2005