A084888 - OEIS

This site is supported by donations to The OEIS Foundation.

A084888

Number of partitions of n^3 into two squares>0.

0, 0, 1, 0, 0, 2, 0, 0, 1, 0, 2, 0, 0, 2, 0, 0, 0, 2, 1, 0, 2, 0, 0, 0, 0, 3, 2, 0, 0, 2, 0, 0, 1, 0, 2, 0, 0, 2, 0, 0, 2, 2, 0, 0, 0, 2, 0, 0, 0, 0, 4, 0, 2, 2, 0, 0, 0, 0, 2, 0, 0, 2, 0, 0, 0, 8, 0, 0, 2, 0, 0, 0, 1, 2, 2, 0, 0, 0, 0, 0, 2, 0, 2, 0, 0, 8, 0, 0, 0, 2, 2, 0, 0, 0, 0, 0, 0, 2, 1, 0, 3, 2 (list; graph; refs; listen; history; internal format)

	OFFSET	`0,6`
	LINKS	`Eric Weisstein's World of Mathematics, Diophantine Equation: 2nd Powers.` `Reinhard Zumkeller, Illustration for A084888 and A000404`
	EXAMPLE	`n=100: 100^3 = 1000000 = 960^2 + 280^2 = 936^2 + 352^2 = 800^2 + 600^2, therefore a(100)=3.`
	CROSSREFS	`Cf. A000404, A063725, A000578, A000290.` `Sequence in context: A029430 A092303 A063725 * A091400 A129448 A123759` `Adjacent sequences: A084885 A084886 A084887 * A084889 A084890 A084891`
	KEYWORD	`nonn`
	AUTHOR	`Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Jun 10 2003`

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

Last modified February 17 00:09 EST 2012. Contains 205978 sequences.