This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A308022 #7 May 09 2019 22:04:06
%S A308022 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 A308022 24,22,28,24,24,24,30,30,34,32,32,32,38,36,40,36,36,42,42,36,36,44,44,
%U A308022 48,50,44,48,50,50,54,54,52,52,46,46,46,60,60,64,60,60
%N A308022 a(n) = prevprime(2*n-1) - nextprime(n-1), where prevprime = A151799 and nextprime = A151800.
%C A308022 a(n) is the difference of the largest and smallest prime(s) in the closed interval [n, 2n-2].
%C A308022 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 A308022 <a href="/index/Par#part">Index entries for sequences related to partitions</a>
%F A308022 a(n) = A151799(2*n-1) - A151800(n-1).
%e A308022 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 A308022 Table[NextPrime[2 n - 1, -1] - NextPrime[n - 1, 1], {n, 2, 100}]
%Y A308022 Cf. A151799, A151800.
%K A308022 nonn,easy
%O A308022 2,4
%A A308022 _Wesley Ivan Hurt_, May 09 2019