|
Search: id:A082548
|
|
|
| A082548 |
|
a(n)= number of values of m such that m can be expressed as the sum of distinct primes with largest prime in the sum = n-th prime. |
|
+0
2
|
|
| 1, 2, 4, 7, 12, 23, 36, 53, 72, 95, 124, 155, 192, 233, 276, 323, 376, 435, 496, 563, 634, 707, 786, 869, 958, 1055, 1156, 1259, 1366, 1475, 1588, 1715, 1846, 1983, 2122, 2271, 2422, 2579, 2742, 2909, 3082, 3261, 3442, 3633, 3826, 4023, 4222, 4433, 4656, 4883
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
EXAMPLE
|
For n=4; 7 is the 4th prime. 7=7, 9= 2+7, 10=3+7, 12= 5+7 = 2+3+7, 14= 2+5+7, 15= 3+5+7, 17= 2+3+5+7. Values of m are 7 and 9,10,12,14,15,17. so a(4)=7.
|
|
PROGRAM
|
(PARI) limit = 70; M = sum(i = 1, limit, prime(i)); v = vector(M); primeSum = 0; forprime (n = 1, prime(limit), count = 1; forstep (i = primeSum, 1, -1, if (v[i], count = count + 1; v[i + n] = 1)); v[n] = 1; print(count); primeSum = primeSum + n)
|
|
CROSSREFS
|
Cf. A082533, A082534.
Sequence in context: A023432 A072641 A135360 this_sequence A007323 A099604 A026790
Adjacent sequences: A082545 A082546 A082547 this_sequence A082549 A082550 A082551
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Naohiro Nomoto (n_nomoto(AT)yabumi.com), May 02 2003
|
|
EXTENSIONS
|
More terms from David Wasserman (wasserma(AT)spawar.navy.mil), Sep 16 2004
|
|
|
Search completed in 0.002 seconds
|
