id:A115230 - OEIS Search Results

Search: id:A115230

Displaying 1-1 of 1 results found.

page 1

Number of ways to write the n-th prime as a sum of a binary power and an odd prime power.

+0
4

1, 2, 2, 2, 2, 2, 2, 2, 1, 2, 3, 1, 1, 1, 1, 2, 1, 2, 1, 1, 1, 1, 3, 2, 2, 1, 1, 1, 2, 2, 1, 1, 1, 3, 0, 1, 2, 1, 2, 2, 1, 3, 0, 1, 2, 3, 1, 1, 2, 2, 1, 1, 2, 1, 2, 0, 0, 3, 1, 1, 2, 2, 0, 1, 2, 1, 0, 0, 3, 2, 3, 1, 1, 0, 1, 2, 1, 1, 2, 1, 0, 2, 1, 2, 1, 2, 1, 1, 2, 2, 1, 1, 1, 1, 2, 3, 0, 1, 2, 1, 0, 1, 2, 0, 2 (list; graph; listen)

	OFFSET	`1,2`
	COMMENT	`a(A115231(n))=0; a(A115232(n))>0; a(A115233(n))=1; a(A006512(n))>0; a(A053703(n))>0.`
	EXAMPLE	`n=25: A000040(25) = 97 = 2^6+311 = 2^5+513 = 2^4+3^4 =` `2^3+89^1 = 2^2+331 = 2^1+519 = 2^0+3*2^5, therefore` `a(25)=#{[16+81],[8+89]}=2.`
	CROSSREFS	`Cf. A000079, A061345.` `Sequence in context: A102671 A037815 A117005 this_sequence A052010 A138471 A102669` `Adjacent sequences: A115227 A115228 A115229 this_sequence A115231 A115232 A115233`
	KEYWORD	`nonn`
	AUTHOR	`Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Jan 17 2006`

page 1

Search completed in 0.002 seconds

Last modified November 18 20:14 EST 2008. Contains 147244 sequences.

AT&T Labs Research