A025428 - OEIS

This site is supported by donations to The OEIS Foundation.

A025428

Number of partitions of n into 4 nonzero squares.

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

	OFFSET	`0,29`
	LINKS	`T. D. Noe, Table of n, a(n) for n=0..10000`
	PROG	`(PARI) for(n=1, 100, print1(sum(a=1, n, sum(b=1, a, sum(c=1, b, sum(d=1, c, if(a^2+b^2+c^2+d^2-n, 0, 1))))), ", "))`
	CROSSREFS	`Cf. A000414, A000534, A025357-A025375` `Sequence in context: A094923 A160499 A065718 * A199176 A021336 A100749` `Adjacent sequences: A025425 A025426 A025427 * A025429 A025430 A025431`
	KEYWORD	`nonn`
	AUTHOR	`David W. Wilson (davidwwilson(AT)comcast.net)`

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

Last modified February 16 06:45 EST 2012. Contains 205866 sequences.