login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A070215 Number of ways to write the n-th prime as a sum of distinct primes. 3
1, 1, 2, 2, 1, 2, 2, 3, 5, 7, 9, 11, 14, 15, 19, 26, 35, 39, 50, 61, 67, 87, 102, 130, 178, 204, 224, 257, 278, 320, 522, 595, 724, 776, 1064, 1136, 1364, 1634, 1836, 2192, 2601, 2761, 3645, 3863, 4294, 4549, 6262, 8558, 9453, 9964, 11001, 12774, 13438 (list; graph; refs; listen; history; internal format)
OFFSET

1,3

LINKS

Seth Troisi, Table of n, a(n) for n = 1..1201

FORMULA

a(n) = A000586(A000040(n)). - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Apr 30 2007

EXAMPLE

With the 10-th prime 29, for instance, we have a(10)=7 distinct-prime partitions, viz. 29=2 + 3 + 7 + 17=2 + 3 + 5 + 19=2 + 3 + 11 + 13=3 + 7 + 19=5 + 7 + 17=5 + 11 + 13.

CROSSREFS

Cf. A000586.

Sequence in context: A112175 A112206 A038541 * A071457 A115034 A027869

Adjacent sequences:  A070212 A070213 A070214 * A070216 A070217 A070218

KEYWORD

nonn,changed

AUTHOR

Lekraj Beedassy (blekraj(AT)yahoo.com), May 07 2002

EXTENSIONS

More terms from Naohiro Nomoto (n_nomoto(AT)yabumi.com) and Don Reble (djr(AT)nk.ca), May 11 2002

Offset in b-file corrected by N. J. A. Sloane, Aug 31 2009

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 16 11:22 EST 2012. Contains 205907 sequences.