cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A218279 Let (p(n), p(n)+2) be the n-th twin prime pair. a(n) is the smallest k, such that there is only one prime in the interval (k*p(n), k*(p(n)+2)), or a(n)=0, if there is no such k.

Original entry on oeis.org

2, 4, 2, 2, 3, 2, 6, 5, 3, 5, 2, 3, 2, 2, 2, 2, 2, 2, 2, 3, 5, 2, 2, 4, 3, 3, 2, 2, 2, 3, 6, 3, 2, 4, 3, 2, 2, 2, 3, 3, 2, 2, 2, 3, 5, 2, 2, 2, 3, 2, 3, 3, 6, 3, 4, 9, 5, 2, 5, 4, 2, 3, 2, 3, 3, 2, 4, 3, 2, 2, 5, 3, 4, 4, 4, 4, 3, 2, 6, 2, 7, 4, 2, 6, 4, 2
Offset: 1

Views

Author

Vladimir Shevelev, Oct 25 2012

Keywords

Comments

Conjecture: a(n)>0 for all n.

Examples

			The first pair of twin primes is (3,5). For k=1 and 2, we have the intervals (3,5) and (6,10), such that not the first but the second interval contains exactly one prime(7). Thus a(1)=2. For n=2 and k=1 to 4, we have the intervals (5,7),(10,14),(15,21), and (20,28) and only the last interval contains exactly one prime(23). Thus, a(2)=4.
		

Crossrefs

Extensions

a(6) corrected and terms beyond a(11) contributed by Zak Seidov, Oct 25 2012