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

 

Logo

Annual Appeal: Please make a donation (tax deductible in USA) to keep the OEIS running. Over 5000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A024680 Number of ways prime(n) is a sum of 3 odd nonprimes r,s,t satisfying 1 <= r < s < t. 0
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 2, 1, 2, 1, 1, 3, 7, 6, 5, 9, 10, 7, 9, 17, 15, 19, 15, 24, 19, 34, 29, 31, 42, 42, 55, 58, 60, 57, 60, 71, 88, 85, 97, 92, 106, 129, 137, 132, 152, 142, 153, 176, 175, 182, 196, 212, 231, 239, 238, 250, 256, 306, 305, 326, 314, 382, 394, 394, 433, 413, 437 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,12

LINKS

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

CROSSREFS

Sequence in context: A266506 A134303 A078997 * A083531 A003417 A158986

Adjacent sequences:  A024677 A024678 A024679 * A024681 A024682 A024683

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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified December 5 19:19 EST 2016. Contains 278770 sequences.