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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A024682 a(n) = number of ways p(n) is a sum of 3 odd nonprimes r,s,t satisfying 15 <= r < s < t. 0
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 2, 2, 2, 3, 7, 6, 8, 7, 11, 9, 18, 17, 20, 25, 25, 32, 36, 38, 40, 42, 49, 59, 62, 69, 68, 75, 91, 105, 104, 114, 112, 120, 134, 141, 149, 160, 172, 183, 193, 195, 203, 218, 255, 257, 271, 268, 317, 333, 342, 368, 358, 379, 413, 432 (list; graph; refs; listen; history; internal format)
OFFSET

1,21

CROSSREFS

Sequence in context: A125721 A049798 A165198 * A091228 A181056 A200918

Adjacent sequences:  A024679 A024680 A024681 * A024683 A024684 A024685

KEYWORD

nonn

AUTHOR

Clark Kimberling (ck6(AT)evansville.edu)

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 15 09:06 EST 2012. Contains 205746 sequences.