id:A024680 - OEIS Search Results

Search: id:A024680

Displaying 1-1 of 1 results found.

page 1

Number of ways prime(n) is a sum of 3 odd nonprimes r,s,t satisfying 1 <= r < s < t.

+0
1

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; listen)

	OFFSET	`1,12`
	CROSSREFS	`Sequence in context: A139368 A134303 A078997 this_sequence A083531 A003417 A158986` `Adjacent sequences: A024677 A024678 A024679 this_sequence A024681 A024682 A024683`
	KEYWORD	`nonn`
	AUTHOR	`Clark Kimberling (ck6(AT)evansville.edu)`

page 1

Search completed in 0.002 seconds

Last modified December 17 23:40 EST 2009. Contains 171025 sequences.

AT&T Labs Research