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 A242398 #24 Aug 19 2014 08:43:07 %S A242398 0,0,0,1,2,4,5,9,9,12,12,16,16,16,18,19,22,23,25,28,38,38,42,49,53,56, %T A242398 58,59,61,79,79,79,81,83,100,100,101,101,103,109,118,121,122,123,124, %U A242398 132,135,137,137,152,153,157,158,159,166,173,173,177,177,181,184,188,188,189,189,190,197,199,204,205,210 %N A242398 Partial sums of the number of primes separating successive pairs of twin primes. %C A242398 a(n) is the number of primes that are not twin primes greater than the first twin prime pair (3,5) and less than the (n+1)th twin prime pair. All primes, other than two either exist in one of the twin prime pairs or are counted in the sum. Two is not included because it occurs before the first twin prime pair. %H A242398 Jens Kruse Andersen, <a href="/A242398/b242398.txt">Table of n, a(n) for n = 1..10000</a> %e A242398 For n=4, a(4)=1. We can get this by writing the first n+1 twin prime pairs and taking the sum of the primes in between them. The pairs are (3,5),(5,7),(11,13),(17,19),(29,31). The only prime between these pairs is 23, thus the answer is one. %o A242398 (PARI) s=0; forprime(p=5, 10^4, if(isprime(p+2), print1(s", "); s--, s++)) \\ _Jens Kruse Andersen_, Aug 17 2014 %Y A242398 Partial sum of A048614. %K A242398 nonn %O A242398 1,5 %A A242398 _Sam Mathers_, Aug 16 2014