login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A100874
Number of terms of A100873 less than 10^n.
0
0, 0, 1, 6, 29, 68, 156, 381, 974, 2406, 5717, 13521, 32431, 78238, 189831, 464411, 1150499, 2881028, 7289744
OFFSET
1,4
PROG
(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) }
CROSSREFS
Cf. A100873.
Sequence in context: A178366 A175956 A164274 * A047923 A006816 A184130
KEYWORD
nonn,hard,more
AUTHOR
Cino Hilliard, Jan 09 2005
EXTENSIONS
Offset corrected and a(6)-a(19) added by Amiram Eldar, Jan 10 2020
STATUS
approved