|
| |
|
|
A096278
|
|
Sums of successive sums of successive sums of successive primes.
|
|
0
| |
|
|
33, 50, 72, 96, 120, 144, 172, 206, 240, 274, 308, 336, 364, 402, 444, 480, 514, 548, 578, 610, 648, 692, 742, 786, 816, 840, 864, 900, 960, 1024, 1070, 1108, 1152, 1196, 1236, 1278, 1320, 1362, 1404, 1444, 1488, 1530, 1560, 1592, 1650, 1728, 1790, 1824
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,1
|
|
|
COMMENTS
| The first term is always odd and may be prime.
|
|
|
FORMULA
| Let f(n) = prime(n) + prime(n+1) f1(n) = f(n)+f(n+1) : SS of order 1 Then f2(n) = f1(n)+f1(n) : SS of order 2 is the general term of this sequence.
|
|
|
EXAMPLE
| The first two terms of SS order 1 is 13 and 20. 13+20 = 33 the first term of the sequence.
|
|
|
PROG
| (PARI) g(n) = for(x=1, n, print1(f2(x)", ")) f(n) = return(prime(n)+prime(n+1)) f1(n) = return(f(n)+f(n+1)) f2(n) = return(f1(n)+f1(n+1))
|
|
|
CROSSREFS
| Sequence in context: A111502 A080933 A020293 * A204381 A034815 A014976
Adjacent sequences: A096275 A096276 A096277 * A096279 A096280 A096281
|
|
|
KEYWORD
| easy,nonn
|
|
|
AUTHOR
| Cino Hilliard (hillcino368(AT)gmail.com), Jun 22 2004
|
| |
|
|
