The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A082547 Number of primes p such that p can be expressed as the sum of distinct primes with largest prime in the sum = n-th prime. 1
1, 2, 2, 2, 4, 5, 9, 11, 16, 22, 26, 30, 38, 45, 51, 59, 68, 77, 83, 96, 106, 115, 127, 139, 151, 165, 177, 190, 204, 221, 236, 250, 267, 286, 304, 323, 339, 361, 382, 400, 421, 440, 465, 486, 512, 533, 556, 580, 604, 633, 656, 686, 713, 739, 769, 797, 827, 856 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
EXAMPLE
For n=5; 11 is the 5th prime. 11=11, 13= 2+11, 19= 3+5+11, 23= 2+3+7+11 = 5+7+11. 11 and 13,19,23 are primes. so a(5)=4.
PROG
(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], if (isprime(i + n), count = count + 1); v[i + n] = 1)); v[n] = 1; print(count); primeSum = primeSum + n)
CROSSREFS
Sequence in context: A057591 A024405 A230381 * A068928 A326025 A278502
KEYWORD
easy,nonn
AUTHOR
Naohiro Nomoto, May 02 2003
EXTENSIONS
More terms from David Wasserman, Sep 16 2004
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 18 07:16 EDT 2024. Contains 372618 sequences. (Running on oeis4.)