cp's OEIS Frontend

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.

A242757 Partial sums of the number of integers between successive twin prime pairs.

This page as a plain text file.
%I A242757 #27 Nov 02 2014 12:18:37
%S A242757 0,3,6,15,24,39,48,75,78,105,114,141,150,153,180,189,216,225,252,285,
%T A242757 354,363,390,447,492,519,534,555,570,717,726,729,756,777,912,921,936,
%U A242757 945,972,1029,1104,1149,1158,1167
%N A242757 Partial sums of the number of integers between successive twin prime pairs.
%C A242757 a(n) is the partial sum of the number of integers separating each successive pair of twin prime numbers less than and up to the n-th pair of twin primes.
%H A242757 Jens Kruse Andersen, <a href="/A242757/b242757.txt">Table of n, a(n) for n = 1..10000</a>
%F A242757 a(n) = A001359(n+1) - 2 - 3*n. - _Robert Israel_, Aug 17 2014
%e A242757 For n=4, a(4)=15 because the number of integers separating the first 4 pairs of twin prime numbers are as follows, 0 between (3,5) and (5,7), 3 between (5,7) and (11,13), 3 between (11,13) and (17,19), and 9 between (17,19) and (29,31). 0+3+3+9=15 so a(4)=15.
%o A242757 (PARI) s=0; q=2; forprime(p=5, 10^4, if(isprime(p+2), s=s+p-q-3; print1(s", "); q=p)) \\ _Jens Kruse Andersen_, Aug 17 2014
%Y A242757 Cf. A001359, A006512.  Partial sums of A204099.
%K A242757 nonn
%O A242757 1,2
%A A242757 _Sam Mathers_, Aug 16 2014