Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A082547
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
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. +0
2
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; listen)
OFFSET

1,2

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.

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], if (isprime(i + n), count = count + 1); v[i + n] = 1)); v[n] = 1; print(count); primeSum = primeSum + n)

CROSSREFS

Cf. A082533, A082534.

Sequence in context: A029045 A057591 A024405 this_sequence A068928 A086420 A103265

Adjacent sequences: A082544 A082545 A082546 this_sequence A082548 A082549 A082550

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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified July 24 12:00 EDT 2008. Contains 142294 sequences.


AT&T Labs Research