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.

A086167 a(n) = sum of the first n lower twin primes.

This page as a plain text file.
%I A086167 #20 Jan 03 2020 07:31:50
%S A086167 3,8,19,36,65,106,165,236,337,444,581,730,909,1100,1297,1524,1763,
%T A086167 2032,2313,2624,2971,3390,3821,4282,4803,5372,5971,6588,7229,7888,
%U A086167 8697,9518,10345,11202,12083,13102,14133,15182,16243,17334,18485
%N A086167 a(n) = sum of the first n lower twin primes.
%H A086167 Amiram Eldar, <a href="/A086167/b086167.txt">Table of n, a(n) for n = 1..10000</a>
%e A086167 For n = 4 we have twin prime pairs (3,5) (5,7) (11,13) (17,19) and 3 + 5 + 11 + 17 = 36.
%t A086167 lst = {}; s = 0; Do[p = Prime[n]; If[PrimeQ[p + 2], s += p; AppendTo[lst,  s]], {n, 6!}]; lst (* _Vladimir Joseph Stephan Orlovsky_, Sep 30 2008 *)
%t A086167 Accumulate[Transpose[Select[Partition[Prime[Range[200]], 2, 1], #[[2]] - #[[1]] == 2 &]][[1]]] (* _Harvey P. Dale_, Feb 02 2011 *)
%o A086167 (PARI) addnexttwin(n)= { s=0; for(x=1,n, if(prime(x+1)-prime(x)==2,s=s+prime(x); print1(s",")) ) }
%Y A086167 Cf. A001359, A086168.
%K A086167 nonn
%O A086167 1,1
%A A086167 _Cino Hilliard_, Aug 25 2003