The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A308022 a(n) = prevprime(2*n-1) - nextprime(n-1), where prevprime = A151799 and nextprime = A151800. 0

%I

%S 0,0,0,2,0,4,2,2,6,8,6,10,6,6,12,14,12,12,14,14,18,20,14,18,18,18,24,

%T 24,22,28,24,24,24,30,30,34,32,32,32,38,36,40,36,36,42,42,36,36,44,44,

%U 48,50,44,48,50,50,54,54,52,52,46,46,46,60,60,64,60,60

%N a(n) = prevprime(2*n-1) - nextprime(n-1), where prevprime = A151799 and nextprime = A151800.

%C a(n) is the difference of the largest and smallest prime(s) in the closed interval [n, 2n-2].

%C Also, the maximum distance between all pairs of primes (not necessarily distinct) appearing among the largest parts of the partitions of 2n into two parts < 2n-1.

%H <a href="/index/Par#part">Index entries for sequences related to partitions</a>

%F a(n) = A151799(2*n-1) - A151800(n-1).

%e a(10) = 6; The primes in the closed interval [10, 18] are 11, 13 and 17. The difference of the largest and smallest primes is 17 - 11 = 6.

%t Table[NextPrime[2 n - 1, -1] - NextPrime[n - 1, 1], {n, 2, 100}]

%Y Cf. A151799, A151800.

%K nonn,easy

%O 2,4

%A _Wesley Ivan Hurt_, May 09 2019

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified May 28 07:18 EDT 2022. Contains 354112 sequences. (Running on oeis4.)