id:A097758 - OEIS Search Results

Search: id:A097758

Displaying 1-1 of 1 results found.

page 1

Greatest integer that can be written as a sum of distinct squares in exactly n ways, or -1 if no such number exists.

+0
4

128, 132, 188, 192, 193, 213, 228, 224, 253, 288, 257, 293, 297, 292, 317, 301, 333, 284, 337, 357, 353, 329, 332, 349, 336, 373, 397, 362, 393, 372, 377, 413, 368, 365, 388, 389, 417, 437, 433, 319, 343, 421, 405, 457, 453, 364, 408, 351, 432, 402, 473 (list; graph; listen)

	OFFSET	`0,1`
	COMMENT	`Trailing edge of table described in A097757; leading edge is A097563.`
	LINKS	`Eric Weisstein's World of Mathematics, Square Number.`
	CROSSREFS	`Cf. A001422, A003995, A033461, A097563, A097757, A097759, A097760.` `Adjacent sequences: A097755 A097756 A097757 this_sequence A097759 A097760 A097761` `Sequence in context: A035880 A010369 A121374 this_sequence A130445 A114565 A109651`
	KEYWORD	`nonn`
	AUTHOR	`Ray Chandler (rayjchandler(AT)sbcglobal.net), Sep 06 2004`

page 1

Search completed in 0.002 seconds

Last modified October 13 09:05 EDT 2008. Contains 145008 sequences.

AT&T Labs Research