- #1
- 2,844
- 0
I was wondering if any nontrivial bounds for http://www.research.att.com/~njas/sequences/A008407 were known. This is the sequence of minimal width for k-tuplets of primes allowed by divisibility concerns. a(2) = 2 since n, n+2 could both be prime; n, n+1 isn't admissible since then either n or n+1 is even.
Clearly a(n+1) >= a(n) + 2, but practically speaking a(n) seems to grow superlinearly.
Clearly a(n+1) >= a(n) + 2, but practically speaking a(n) seems to grow superlinearly.
Last edited by a moderator: