Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A024681
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A024681 a(n) = number of ways p(n) is a sum of 3 odd nonprimes r,s,t satisfying 9 <= r < s < t. +0
1
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 2, 2, 2, 4, 5, 4, 6, 10, 9, 11, 10, 16, 13, 23, 21, 24, 32, 34, 40, 44, 47, 48, 50, 60, 69, 72, 80, 78, 88, 104, 118, 117, 131, 127, 136, 149, 157, 164, 177, 192, 201, 212, 213, 223, 236, 277, 279, 294, 290, 342, 358, 367, 398, 385, 409, 441 (list; graph; listen)
OFFSET

1,18

CROSSREFS

Sequence in context: A089819 A059888 A151680 this_sequence A007495 A122385 A035002

Adjacent sequences: A024678 A024679 A024680 this_sequence A024682 A024683 A024684

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 December 20 16:54 EST 2009. Contains 171081 sequences.


AT&T Labs Research