Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A024684
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A024684 Number of ways p(n) is a sum of 3 primes r,s,t satisfying r < s <t. +0
1
0, 0, 0, 0, 0, 0, 0, 1, 2, 3, 4, 5, 6, 6, 9, 11, 13, 13, 15, 18, 17, 19, 25, 26, 28, 32, 31, 37, 32, 39, 44, 51, 54, 48, 60, 55, 62, 64, 73, 80, 79, 74, 89, 84, 92, 86, 92, 107, 119, 105, 118, 122, 117, 135, 143, 146, 147, 141, 149, 159, 157, 176, 175, 190, 180, 196, 185, 195, 230, 202, 232 (list; graph; listen)
OFFSET

1,9

CROSSREFS

Adjacent sequences: A024681 A024682 A024683 this_sequence A024685 A024686 A024687

Sequence in context: A122168 A017856 A087412 this_sequence A037850 A037886 A031045

KEYWORD

nonn

AUTHOR

Clark Kimberling (ck6(AT)evansville.edu)

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 October 12 15:26 EDT 2008. Contains 144830 sequences.


AT&T Labs Research