[go: up one dir, main page]

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!)
A374287 a(n) is the smallest number which can be represented as the sum of n distinct nonzero squares in exactly 2 ways, or -1 if no such number exists. 2
-1, 65, 62, 90, 103, 136, 200, 276, 376, 481, 625, 806, 975, 1183, 1415, 1688, 1989, 2325, 2698, 3110, 3563, 4059, 4600, 5188, 5825, 6513, 7254, 8050, 8903, 9815, 10788, 11824, 12925, 14093, 15330, 16638, 18019, 19475, 21008, 22620, 24313, 26089, 27950, 29898 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
EXAMPLE
a(2) = 65 = 1^2 + 8^2 = 4^2 + 7^2.
a(3) = 62 = 1^2 + 5^2 + 6^2 = 2^2 + 3^2 + 7^2.
CROSSREFS
Sequence in context: A303240 A298725 A299559 * A130764 A043625 A296877
KEYWORD
sign
AUTHOR
Ilya Gutkovskiy, Jul 02 2024
EXTENSIONS
a(12) and beyond from Michael S. Branicky, Jul 02 2024
STATUS
approved

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 August 30 17:11 EDT 2024. Contains 375545 sequences. (Running on oeis4.)