|
Search: id:A135277
|
|
|
| A135277 |
|
Sum of staircase primes according to the rule: bottom + top + next top. |
|
+0
1
|
|
| 10, 23, 41, 59, 83, 109, 131, 159, 187, 211, 235, 269, 301, 319, 349, 395, 425, 457, 487, 519, 551, 581, 607, 661, 689, 713, 749, 789, 817, 841, 883, 931, 961, 1015, 1049, 1079, 1119, 1151, 1187, 1229, 1271, 1303, 1331, 1367, 1391, 1433, 1477, 1511, 1553, 1611
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
FORMULA
|
We list the primes in staircase fashion as in A135274. The right diagonal, RD(n), is the set of top primes and the left diagonal, LD(n), is the set of bottom primes. Then a(n) = LD(n+1) + RD(n) + RD(n+2).
|
|
PROGRAM
|
(PARI) g(n) = forstep(x=1, n, 2, y=prime(x+1) + prime(x) + prime(x+2); print1(y", "))
|
|
CROSSREFS
|
Sequence in context: A154033 A140674 A072245 this_sequence A156202 A164578 A102089
Adjacent sequences: A135274 A135275 A135276 this_sequence A135278 A135279 A135280
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Cino Hilliard (hillcino368(AT)hotmail.com), Dec 02 2007
|
|
|
Search completed in 0.002 seconds
|
