login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons 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; text; internal format)
OFFSET

1,21

LINKS

Table of n, a(n) for n=1..74.

CROSSREFS

Sequence in context: A049798 A165198 A245526 * A091228 A181056 A200918

Adjacent sequences:  A024679 A024680 A024681 * A024683 A024684 A024685

KEYWORD

nonn

AUTHOR

Clark Kimberling

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 8 02:22 EDT 2020. Contains 336290 sequences. (Running on oeis4.)