cp's OEIS Frontend

A344117 Number of twin prime pairs in the range (6*n + 1, 6*(n + m) + 1], where m is the number of twin prime pairs, 6*k +- 1 for k = 1, 2, ..., n.

%I A344117 #17 Jul 01 2021 23:43:40
%S A344117 1,1,1,2,1,2,2,2,2,1,2,2,2,2,2,3,3,2,2,2,3,3,4,4,3,3,4,4,5,4,4,4,4,4,
%T A344117 4,4,4,4,4,3,3,4,4,4,3,3,2,2,2,2,2,2,3,3,3,3,3,3,3,3,3,3,3,3,3,3,4,4,
%U A344117 4,3,3,2,3,3,3,3,3,3,3,4,4,4,4,5,5,5,5
%N A344117 Number of twin prime pairs in the range (6*n + 1, 6*(n + m) + 1], where m is the number of twin prime pairs, 6*k +- 1 for k = 1, 2, ..., n.
%C A344117 Conjecture: a(n) >= 1.
%o A344117 (Python)
%o A344117 from sympy import isprime
%o A344117 def istwin(m): return 1 if isprime(6*m-1)*isprime(6*m+1) == 1 else 0
%o A344117 ct1 = 0
%o A344117 for n in range(1, 100):
%o A344117     ct1 += istwin(n); ct = 0
%o A344117     for m in range (n + 1, n + ct1 + 1): ct += istwin(m)
%o A344117     print(ct)
%Y A344117 Cf. A071538, A079629, A080356, A237840, A332086, A337788.
%K A344117 nonn
%O A344117 1,4
%A A344117 _Ya-Ping Lu_, Jun 24 2021