login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A097758 Greatest integer that can be written as a sum of distinct squares in exactly n ways, or -1 if no such number exists. 3

%I #3 Mar 30 2012 17:29:19

%S 128,132,188,192,193,213,228,224,253,288,257,293,297,292,317,301,333,

%T 284,337,357,353,329,332,349,336,373,397,362,393,372,377,413,368,365,

%U 388,389,417,437,433,319,343,421,405,457,453,364,408,351,432,402,473

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

%C Trailing edge of table described in A097757; leading edge is A097563.

%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/SquareNumber.html">Square Number.</a>

%Y Cf. A001422, A003995, A033461, A097563, A097757, A097759, A097760.

%K nonn

%O 0,1

%A _Ray Chandler_, Sep 06 2004

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 08:28 EDT 2024. Contains 371927 sequences. (Running on oeis4.)