OFFSET
0,2
COMMENTS
It seems that the fraction of prime gaps g, satisfying g == 2 (mod 6), tends to a constant, say c, when the number of prime gaps tends to infinity. From n = 28 we obtain that c < 0.276, while it can be argued heuristically that c > 0.25.
LINKS
Martin Ehrenstein, Table of n, a(n) for n = 0..43
PROG
(PARI) a(n) = my(vp=primes(2^n+2)); #select(x->((x%6)==2), vector(#vp-1, k, vp[k+1]-vp[k])); \\ Michel Marcus, Feb 16 2021
CROSSREFS
KEYWORD
nonn
AUTHOR
A.H.M. Smeets, Feb 13 2021
EXTENSIONS
a(29) and beyond from Martin Ehrenstein, Mar 01 2021
STATUS
approved