The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A096277 Sum of successive sums of successive primes: a(n) = s(n) + s(n+1) where s(n) = prime(n) + prime(n+1) (A001043). 5
 13, 20, 30, 42, 54, 66, 78, 94, 112, 128, 146, 162, 174, 190, 212, 232, 248, 266, 282, 296, 314, 334, 358, 384, 402, 414, 426, 438, 462, 498, 526, 544, 564, 588, 608, 628, 650, 670, 692, 712, 732, 756, 774, 786, 806, 844, 884, 906, 918, 934 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS The first term is the only term that has a chance of being prime. LINKS Seiichi Manyama, Table of n, a(n) for n = 1..10000 FORMULA a(n) = A001043(n) + A001043(n+1) = A000040(n) + 2*A000040(n+1) + A000040(n+2). - M. F. Hasler, Jun 02 2017 EXAMPLE The sums of the first two pairs of successive primes are 5 and 8. 5+8 = 13 is the first term in the sequence. MATHEMATICA Total/@Partition[Total/@Partition[Prime[Range[60]], 2, 1], 2, 1] (* Harvey P. Dale, May 10 2011 *) PROG (PARI) f1(n, f(n)=prime(n)+prime(n+1)) = for(x=1, n, print(f(x)+f(x+1)", ")) CROSSREFS Cf. A001043, A000040. Sequence in context: A014158 A171143 A058016 * A164475 A164483 A164468 Adjacent sequences:  A096274 A096275 A096276 * A096278 A096279 A096280 KEYWORD easy,nonn AUTHOR Cino Hilliard, Jun 22 2004 EXTENSIONS Edited by M. F. Hasler, Jun 02 2017 STATUS approved

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

Last modified July 24 23:25 EDT 2021. Contains 346273 sequences. (Running on oeis4.)