id:A064873 - OEIS Search Results

Search: id:A064873

Displaying 1-1 of 1 results found.

page 1

First of four sequences representing the lexicographical minimal decomposition of n in 4 squares: n = a(n)^2 + A064874(n)^2 + A064875(n)^2 + A064876(n)^2.

+0
6

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

	OFFSET	`0,1`
	COMMENT	`A072401(n) = A057427(a(n)).` `For k<112: a(n)=A072401(n), but A072401(112) = 1<>a(112)=2, as also A072401(112 - 1) = 1.`
	LINKS	`Eric Weisstein's World of Mathematics, Square Numbers.` `Index entries for sequences related to sums of squares.`
	EXAMPLE	`a(25) = 0: 25 = a(25)^2 + A064874(25)^2 + A064875(25)^2 + A064876(25)^2 = 0 + 0 + 0 + 25 and the other decompositions (0, 0, 3, 4) and (1, 2, 2, 4) are greater than (0, 0, 0, 5).`
	CROSSREFS	`Cf. A064874, A064875, A064876, A071374.` `Sequence in context: A011722 A044938 A072401 this_sequence A037823 A115790 A025460` `Adjacent sequences: A064870 A064871 A064872 this_sequence A064874 A064875 A064876`
	KEYWORD	`nonn`
	AUTHOR	`Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Oct 10 2001`

page 1

Search completed in 0.002 seconds

Last modified November 30 13:13 EST 2009. Contains 167758 sequences.

AT&T Labs Research