OFFSET
1,2
COMMENTS
Conjecture: a(n) < log(A014574(n))^2. - Thomas Ordowski, Jul 21 2012
Conjecture: All positive integers are represented in this sequence. This is verified up to 184, by searching up to prime indexes of ~128000000. The rate of filling-in the smallest remaining gap among the integers, and the growth in the maximum value found, both slow down considerably relative to a fixed quantity of twin prime incidences examined in each pass. The maximum value found was 237. - Richard R. Forberg, Jul 28 2016
All positive integers below 312 are in this sequence. - Charles R Greathouse IV, Aug 01 2016
From Gus Wiseman, Jun 11 2024: (Start)
Also the length of the n-th maximal antirun of prime numbers > 3, where an antirun is an interval of positions at which consecutive terms differ by more than 2. These begin:
5
7 11
13 17
19 23 29
31 37 41
43 47 53 59
61 67 71
73 79 83 89 97 101
(End)
LINKS
MATHEMATICA
Differences[Flatten[Position[Differences[Prime[Range[500]]], 2]]] (* Harvey P. Dale, Nov 17 2018 *)
Length/@Split[Select[Range[4, 10000], PrimeQ[#]&], #1+2!=#2&]//Most (* Gus Wiseman, Jun 11 2024 *)
PROG
(Sage)
def A027833(n) :
a = [ ]
st = 2
for i in (3..n) :
if (nth_prime(i+1)-nth_prime(i) == 2) :
a.append(i-st)
st = i
return(a)
A027833(496) # Jani Melik, May 15 2014
(PARI) n=1; p=5; forprime(q=7, 1e3, if(q-p==2, print1(n", "); n=1, n++); p=q) \\ Charles R Greathouse IV, Aug 01 2016
CROSSREFS
KEYWORD
nonn
AUTHOR
Jean-Marc MALASOMA (Malasoma(AT)entpe.fr)
STATUS
approved