A125688 - OEIS

This site is supported by donations to The OEIS Foundation.

A125688

Number of partitions of n into three distinct primes.

0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 1, 1, 0, 2, 1, 2, 2, 2, 2, 2, 2, 3, 3, 2, 3, 2, 4, 3, 4, 2, 5, 3, 5, 4, 6, 1, 6, 3, 6, 4, 6, 3, 9, 3, 8, 5, 8, 4, 11, 3, 11, 5, 10, 3, 13, 3, 13, 6, 12, 2, 14, 5, 15, 6, 13, 2, 18, 5, 17, 6, 14, 4, 21, 5, 19, 7, 17, 4, 25, 4, 20, 8, 21, 4, 26, 4, 25, 9, 22, 4 (list; graph; refs; listen; history; internal format)

	OFFSET	`1,18`
	COMMENTS	`a(A124868(n)) = 0; a(A124867(n)) > 0;` `a(A125689(n)) = n and a(m) <> n for m < A125689(n).`
	LINKS	`R. Zumkeller, Table = of n, a(n) for n = 1..10000`
	EXAMPLE	`a(42) = #{2+3+37, 2+11+29, 2+17+23} = 3.`
	CROSSREFS	`Sequence in context: A067754 A194824 A025851 * A060508 A029404 A029417` `Adjacent sequences: A125685 A125686 A125687 * A125689 A125690 A125691`
	KEYWORD	`nonn`
	AUTHOR	`Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Nov 30 2006`

Content is available under The OEIS End-User License Agreement .

Last modified February 16 17:48 EST 2012. Contains 205939 sequences.