|
Search: id:A070757
|
|
|
| A070757 |
|
Number of ways to write 4n as a sum of 4 primes. |
|
+0
1
|
|
| 0, 1, 2, 3, 5, 6, 9, 11, 14, 19, 23, 25, 32, 36, 40, 50, 55, 57, 70, 76, 81, 96, 100, 109, 126, 129, 138, 156, 163, 175, 199, 198, 211, 239, 241, 258, 283, 281, 308, 335, 335, 360, 382, 385, 421, 445, 437, 482, 508, 503, 556, 571, 561, 632, 657, 645, 705, 726
(list; graph; listen)
|
|
|
OFFSET
|
1,3
|
|
|
EXAMPLE
|
4*3=12=2+2+3+5=3+3+3+3 hence a(3)=2
|
|
PROGRAM
|
(PARI) for(n=1, 75, print1(sum(i=1, n, sum(j=1, i, sum(k=1, j, sum(l=1, k, if(prime(i)+prime(j)+prime(k)+prime(l)-4*n, 0, 1))))), ", "))
|
|
CROSSREFS
|
Sequence in context: A070991 A008747 A054639 this_sequence A123399 A104738 A028309
Adjacent sequences: A070754 A070755 A070756 this_sequence A070758 A070759 A070760
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Benoit Cloitre (benoit7848c(AT)orange.fr), May 14 2002
|
|
|
Search completed in 0.004 seconds
|
