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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A350241 a(n) is the smallest number which can be represented as the sum of n distinct nonzero squares in exactly n ways, or 0 if no such number exists. 5
 1, 65, 101, 142, 175, 255, 316, 380, 501, 625, 794, 995, 1155, 1456, 1696, 2012, 2373, 2709, 3118, 3566, 4158, 4608, 5211, 5852, 6500, 7221, 8065, 8906, 9766, 11089, 11855, 12868, 14020, 15337, 16601, 17854, 19255, 20840, 22364, 23964, 25813, 27665, 29650, 31635 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS Table of n, a(n) for n=1..44. Index entries for sequences related to sums of squares EXAMPLE For n = 2: 65 = 1^2 + 8^2 = 4^2 + 7^2. For n = 3: 101 = 1^2 + 6^2 + 8^2 = 2^2 + 4^2 + 9^2 = 4^2 + 6^2 + 7^2. CROSSREFS Cf. A000290, A025341, A025379, A025415, A025417, A052261, A093195, A097563, A215908, A341040. Sequence in context: A063519 A299456 A300094 * A342259 A075893 A064901 Adjacent sequences: A350238 A350239 A350240 * A350242 A350243 A350244 KEYWORD nonn AUTHOR Ilya Gutkovskiy, Dec 21 2021 EXTENSIONS More terms from Jinyuan Wang, Dec 21 2021 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.

Last modified May 27 22:51 EDT 2023. Contains 362992 sequences. (Running on oeis4.)