Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A024682
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A024682 a(n) = number of ways p(n) is a sum of 3 odd nonprimes r,s,t satisfying 15 <= r < s < t. +0
1
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; listen)
OFFSET

1,21

CROSSREFS

Adjacent sequences: A024679 A024680 A024681 this_sequence A024683 A024684 A024685

Sequence in context: A091712 A125721 A049798 this_sequence A091228 A134890 A101360

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 6 16:13 EDT 2008. Contains 144667 sequences.


AT&T Labs Research