A364341 - cp's OEIS frontend

A364341 a(n) is the greatest k such that there are exactly n distinct numbers j that can be expressed as the sum of two squares with k^2 < j < (k+1)^2, or -1 if such a k does not exist.

%I A364341 #7 Jul 30 2023 13:33:21
%S A364341 0,1,3,4,6,7,11,10,14,12,16,20,22,23,21,27,29,30,32,35,38,37,42,44,47,
%T A364341 43,54,52,51,58,57,62,56,71,64,67,68,73,76,77,78,83,72,87,90,91,-1,95,
%U A364341 103,100,107,109,105,104,108,-1,116,119,110,129,117,126,-1,128,134
%N A364341 a(n) is the greatest k such that there are exactly n distinct numbers j that can be expressed as the sum of two squares with k^2 < j < (k+1)^2, or -1 if such a k does not exist.
%C A364341 Index of last occurrence of n in A077773 if there is any, otherwise -1.
%Y A364341 Cf. A077773, A363761, A363763.
%K A364341 sign
%O A364341 0,3
%A A364341 _Rainer Rosenthal_, Jul 20 2023

cp's OEIS Frontend

A364341 a(n) is the greatest k such that there are exactly n distinct numbers j that can be expressed as the sum of two squares with k^2 < j < (k+1)^2, or -1 if such a k does not exist.