id:A112687 - OEIS Search Results

Search: id:A112687

Displaying 1-1 of 1 results found.

page 1

Numbers n that can not be decomposed into the sum of at most 4 square numbers when using the following algorithm: Repeat the following 2 steps 4 times: 1-find the largest square s smaller than n; 2-n=n-s Numbers that can be decomposed yield final values of n=0. The sequence presented is of those numbers where n is not 0 when this algorithm ends.

+0
1

23, 32, 43, 48, 56, 61, 71, 76, 79, 88, 93, 96, 107, 112, 115, 119, 128, 133, 136, 140, 143, 151, 156, 159, 163, 166, 176, 181, 184, 188, 191, 203, 208, 211, 215, 218, 224, 232, 237, 240, 244, 247, 253, 263, 268, 271, 275, 278, 284, 287, 296, 301, 304, 308 (list; graph; listen)

	OFFSET	`1,1`
	COMMENT	`Found while writing a program to decompose integers as sums of four square numbers (following Lagrange's Four-Square Theorem).`
	LINKS	`Eric Weisstein's World of Mathematics, Lagrange's Four-Square Theorem`
	EXAMPLE	`23 is the first number that cannot be decomposed because 16+4+1+1 falls short by one.`
	CROSSREFS	`Adjacent sequences: A112684 A112685 A112686 this_sequence A112688 A112689 A112690` `Sequence in context: A093477 A070664 A096083 this_sequence A107282 A039410 A043233`
	KEYWORD	`nonn`
	AUTHOR	`Luis F.B.A. Alexandre (lfbaa(AT)di.ubi.pt), Dec 31 2005`

page 1

Search completed in 0.002 seconds

Last modified October 11 13:47 EDT 2008. Contains 144830 sequences.

AT&T Labs Research