cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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.

This page as a plain text file.
%I A350241 #6 Dec 25 2021 02:43:28
%S A350241 1,65,101,142,175,255,316,380,501,625,794,995,1155,1456,1696,2012,
%T A350241 2373,2709,3118,3566,4158,4608,5211,5852,6500,7221,8065,8906,9766,
%U A350241 11089,11855,12868,14020,15337,16601,17854,19255,20840,22364,23964,25813,27665,29650,31635
%N 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.
%H A350241 <a href="/index/Su#ssq">Index entries for sequences related to sums of squares</a>
%e A350241 For n = 2: 65 = 1^2 + 8^2 = 4^2 + 7^2.
%e A350241 For n = 3: 101 = 1^2 + 6^2 + 8^2 = 2^2 + 4^2 + 9^2 = 4^2 + 6^2 + 7^2.
%Y A350241 Cf. A000290, A025341, A025379, A025415, A025417, A052261, A093195, A097563, A215908, A341040.
%K A350241 nonn
%O A350241 1,2
%A A350241 _Ilya Gutkovskiy_, Dec 21 2021
%E A350241 More terms from _Jinyuan Wang_, Dec 21 2021