id:A087942 - OEIS Search Results

Search: id:A087942

Displaying 1-1 of 1 results found.

page 1

Number of partitions of n into as many primes as n has prime factors.

+0
2

0, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 1, 2, 1, 3, 1, 2, 1, 2, 1, 3, 1, 7, 1, 3, 7, 3, 1, 2, 1, 11, 1, 4, 0, 15, 1, 2, 1, 21, 1, 3, 1, 4, 12, 4, 1, 26, 1, 5, 0, 4, 1, 33, 1, 38, 0, 4, 1, 41, 1, 3, 19, 137, 0, 5, 1, 6, 1, 2, 1, 61, 1, 5, 22, 5, 0, 5, 1, 67, 24, 5, 1, 81, 1, 5, 0, 96, 1, 93, 1, 9, 0 (list; graph; listen)

	OFFSET	`1,10`
	COMMENT	`Conjecture, for m>1: a(m)=0 iff n is an odd semiprime such that m-2 is not prime, i.e. m=A089268(k) for some k. - Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Oct 28 2003`
	LINKS	`Eric Weisstein's World of Mathematics, Prime Partition.` `Index entries for sequences related to Goldbach conjecture`
	EXAMPLE	`n=20 = 225 = 13+5+2 = 11+7+2, all other partitions into 3` `primes have less than or more than 3 parts, therefore a(20)=2.`
	CROSSREFS	`Cf. A001222, A000607, A051034, A004526.` `Adjacent sequences: A087939 A087940 A087941 this_sequence A087943 A087944 A087945` `Sequence in context: A114228 A060938 A119647 this_sequence A099042 A140774 A070040`
	KEYWORD	`nonn`
	AUTHOR	`Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Oct 27 2003`

page 1

Search completed in 0.002 seconds

Last modified October 7 08:31 EDT 2008. Contains 144667 sequences.

AT&T Labs Research