id:A095840 - OEIS Search Results

Search: id:A095840

Displaying 1-1 of 1 results found.

page 1

Number of ways to write the n-th prime power as sum of two prime powers.

+0
3

0, 1, 1, 2, 2, 2, 3, 3, 3, 3, 4, 3, 3, 2, 3, 4, 3, 3, 7, 2, 3, 3, 2, 3, 2, 2, 3, 7, 2, 2, 3, 2, 4, 4, 3, 2, 2, 2, 2, 2, 4, 2, 3, 1, 11, 3, 3, 4, 0, 2, 3, 1, 3, 3, 3, 1, 4, 1, 1, 2, 4, 2, 1, 3, 3, 2, 1, 3, 5, 1, 12, 3, 2, 1, 3, 2, 2, 3, 2, 4, 2, 1, 2, 2, 0, 1, 1, 3, 2, 4, 2, 3, 2, 0, 2, 3, 1, 2, 2, 2, 1, 3 (list; graph; listen)

	OFFSET	`1,4`
	COMMENT	`a(n) = A071330(A000961(n)).` `See A095842 and A095841 for prime powers having not more than one partition into two prime powers.`
	EXAMPLE	`A000961(8) = 3^2 = 9 = 1+8 = 2+7 = 4+5, therefore a(8)=3.`
	CROSSREFS	`Sequence in context: A162345 A048689 A069923 this_sequence A131343 A089051 A108229` `Adjacent sequences: A095837 A095838 A095839 this_sequence A095841 A095842 A095843`
	KEYWORD	`nonn`
	AUTHOR	`Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Jun 10 2004`

page 1

Search completed in 0.002 seconds

Last modified December 10 12:37 EST 2009. Contains 170569 sequences.

AT&T Labs Research