OFFSET
1,1
COMMENTS
Distance between the pair of primes adjacent to the (n+1)-st prime. - Lekraj Beedassy, Oct 01 2004 [Typo corrected by Zak Seidov, Feb 22 2009]
A031131(A261525(n)) = 2*n and A031131(m) != 2*n for m < A261525(n). - Reinhard Zumkeller, Aug 23 2015
The Polymath project 8b proved that a(n) <= 395106 infinitely often (their published paper contains the slightly weaker bound a(n) <= 398130 infinitely often). - Charles R Greathouse IV, Jul 22 2016
LINKS
T. D. Noe, Table of n, a(n) for n = 1..10000
D. H. J. Polymath, Variants of the Selberg sieve, and bounded intervals containing many primes, Research in the Mathematical Sciences 1:12 (2014).
Polymath project, Bounded gaps between primes
FORMULA
EXAMPLE
a(10)=8 because the 10th prime=29 is followed by primes 31 and 37, and 37 - 29 = 8.
MAPLE
P:= select(isprime, [2, seq(2*i+1, i=1..1000)]):
P[3..-1] - P[1..-3]; # Robert Israel, Jan 25 2015
MATHEMATICA
Differences[lst_]:=Drop[lst, 2]-Drop[lst, -2]; Differences[Prime[Range[123]]] (* Vladimir Joseph Stephan Orlovsky, Aug 13 2009 *)
Map[#3 - #1 & @@ # &, Partition[Prime@ Range[84], 3, 1]] (* Michael De Vlieger, Dec 17 2017 *)
PROG
(MuPAD) ithprime(i+2)-ithprime(i) $ i = 1..65 // Zerinvary Lajos, Feb 26 2007
(Sage)
BB = primes_first_n(67)
L = []
for i in range(65):
L.append(BB[2+i]-BB[i])
L
# Zerinvary Lajos, May 14 2007
(Magma) [NthPrime(n+2)-NthPrime(n): n in [1..100] ]; // Vincenzo Librandi, Apr 11 2011
(PARI) a(n)=my(p=prime(n)); nextprime(nextprime(p+1)+1)-p \\ Charles R Greathouse IV, Jul 01 2013
(Haskell)
a031131 n = a031131_list !! (n-1)
a031131_list = zipWith (-) (drop 2 a000040_list) a000040_list
-- Reinhard Zumkeller, Dec 19 2013
CROSSREFS
KEYWORD
nonn
AUTHOR
EXTENSIONS
Corrected by T. D. Noe, Sep 11 2008
Edited by N. J. A. Sloane, Sep 18 2008, at the suggestion of T. D. Noe
STATUS
approved