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.
%I A090736 #12 May 08 2022 08:47:58
%S A090736 0,1,1,1,2,2,2,2,2,3,3,3,4,4,4,4,5,5,5,5,5,5,5,5,6,7,7,7,8,8,8,8,8,9,
%T A090736 9,9,10,10,10,10,11,11,11,11,11,11,11,11,11,12,12,12,13,13,13,13,13,
%U A090736 14,14,14,15,15,15,15,16,16,16,16,16,16,16,16,17,18,18,18,18,18,18,18,18,19
%N A090736 Number of positive integers <= n that can be expressed as a sum of 2 coprime squares > 0.
%D A090736 Steven R. Finch, Mathematical Constants, Cambridge, 2003, p. 100
%H A090736 Amiram Eldar, <a href="/A090736/b090736.txt">Table of n, a(n) for n = 1..10000</a>
%F A090736 a(n) is asymptotic to (3/(8*K))*n/sqrt(log(n)) where K is the Landau-Ramanujan constant (A064533).
%t A090736 Accumulate[Table[Boole[n > 1 && IntegerExponent[n, 2] < 2 && AllTrue[FactorInteger[n][[;; , 1]], Mod[#, 4] < 3 &]], {n, 1, 100}]] (* _Amiram Eldar_, May 08 2022 *)
%o A090736 (PARI) a(n)=sum(i=1,n,if(sum(u=1,i,sum(v=1,u,if(abs(u^2+v^2-i)+abs(gcd(u,v)-1),0,1))),1,0))
%Y A090736 Cf. A008784, A064533, A090735.
%K A090736 nonn
%O A090736 1,5
%A A090736 _Benoit Cloitre_, Jan 18 2004