id:A071335 - OEIS Search Results

Search: id:A071335

Displaying 1-1 of 1 results found.

page 1

Number of partitions of n into sum of at most three primes.

+0
3

0, 1, 1, 1, 2, 2, 3, 2, 3, 3, 3, 3, 4, 3, 4, 4, 5, 4, 5, 4, 6, 5, 6, 6, 6, 6, 7, 5, 8, 5, 8, 5, 10, 6, 8, 8, 10, 6, 11, 5, 12, 7, 12, 7, 13, 7, 14, 9, 13, 9, 15, 7, 17, 8, 15, 8, 17, 7, 17, 10, 18, 9, 20, 8, 21, 11, 21, 8, 21, 7, 23, 11, 23, 11, 23, 10, 28, 12, 25, 11, 26 (list; graph; listen)

	OFFSET	`1,5`
	LINKS	`T. D. Noe, Table of n, a(n) for n=1..10000`
	EXAMPLE	`a(21)=6 as 21 = 2+19 = 2+2+17 = 3+5+13 = 3+7+11 = 5+5+11 = 7+7+7`
	CROSSREFS	`Cf. A002375, A068307, A025583.` `Sequence in context: A097849 A100678 A026834 this_sequence A076223 A076235 A057941` `Adjacent sequences: A071332 A071333 A071334 this_sequence A071336 A071337 A071338`
	KEYWORD	`nonn`
	AUTHOR	`Reinhard Zumkeller (reinhard.zumkeller(AT)lhsystems.com), May 19 2002`

page 1

Search completed in 0.002 seconds

Last modified August 19 23:53 EDT 2008. Contains 142930 sequences.

AT&T Labs Research