id:A024683 - OEIS Search Results

Search: id:A024683

Displaying 1-1 of 1 results found.

page 1

a(n) = number of ways p(n) is a sum of two composite numbers r,s satisfying r < s.

+0
1

0, 0, 0, 0, 0, 1, 1, 2, 2, 4, 5, 6, 7, 8, 8, 10, 12, 13, 14, 15, 16, 17, 18, 20, 23, 24, 25, 25, 26, 26, 32, 33, 35, 36, 39, 40, 41, 43, 44, 46, 48, 49, 52, 53, 53, 54, 58, 63, 64, 65, 65, 67, 68, 71, 73, 75, 77, 78, 79, 80, 81, 84, 90, 91, 92, 92, 98, 100, 104, 105, 105, 107, 110, 112, 114 (list; graph; listen)

	OFFSET	`1,8`
	CROSSREFS	`Sequence in context: A130498 A064574 A059015 this_sequence A071528 A056902 A089676` `Adjacent sequences: A024680 A024681 A024682 this_sequence A024684 A024685 A024686`
	KEYWORD	`nonn`
	AUTHOR	`Clark Kimberling (ck6(AT)evansville.edu)`

page 1

Search completed in 0.002 seconds

Last modified August 29 14:50 EDT 2008. Contains 143238 sequences.

AT&T Labs Research