|
| |
|
|
A096277
|
|
Sum of successive sums of successive primes.
|
|
0
| |
|
|
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; internal format)
|
|
|
|
OFFSET
| 1,1
|
|
|
COMMENTS
| The first term is the only term that has a chance of being prime.
|
|
|
FORMULA
| Let f(n) = prime(n) + prime(n+1) be the sum of the n-th and (n+1)-th primes. Then f1(n1) = f(n1)+f(n1+1) is the general term of the sequence.
|
|
|
EXAMPLE
| The sums of the first two 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] (* From Harvey P. Dale, May 10 2011 *)
|
|
|
PROG
| (PARI) f1(n) = for(x=1, n, print(f(x)+f(x+1)", ")) f(n) = return(prime(n)+prime(n+1))
|
|
|
CROSSREFS
| Sequence in context: A164486 A164482 A058016 * A164476 A164466 A164475
Adjacent sequences: A096274 A096275 A096276 * A096278 A096279 A096280
|
|
|
KEYWORD
| easy,nonn
|
|
|
AUTHOR
| Cino Hilliard (hillcino368(AT)gmail.com), Jun 22 2004
|
| |
|
|
