A115397 - OEIS

This site is supported by donations to The OEIS Foundation.

A115397

Number of ways to represent 2n+1 as i+j with 0<i<j and i^4+j^4 prime.

1, 2, 3, 2, 3, 3, 1, 5, 4, 4, 4, 5, 4, 7, 6, 5, 2, 9, 2, 5, 5, 2, 4, 2, 3, 2 (list; graph; refs; listen; history; internal format)

	OFFSET	`1,2`
	EXAMPLE	`n=6: 2*6+1 = 13 = 2+11 = 5+8 = 6+7 and` `prime(1717)=14657, prime(636)=4721, prime(516)=3697,` `a(6) = #{14657=2^4+11^4, 4721=5^4+8^4, 3697=6^4+7^4} = 3.`
	CROSSREFS	`Cf. A036468, A005408.` `Sequence in context: A119880 A075019 A138960 * A200323 A075370 A030350` `Adjacent sequences: A115394 A115395 A115396 * A115398 A115399 A115400`
	KEYWORD	`nonn`
	AUTHOR	`Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Mar 08 2006`

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

Last modified February 14 04:10 EST 2012. Contains 205570 sequences.