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 A371014 #7 Mar 08 2024 08:09:45
%S A371014 1,2,1,3,2,2,1,4,2,4,1,3,2,2,2,5,2,4,1,6,1,2,1,4,3,4,2,3,2,4,1,6,1,4,
%T A371014 2,6,2,2,2,8,2,2,1,3,4,2,1,5,2,6,2,6,2,4,2,4,1,4,1,6,2,2,2,7,4,2,1,6,
%U A371014 1,4,1,8,2,4,3,3,1,4,1,10,3,4,1,3,4,2,2
%N A371014 The number of divisors of n that are the sum of 2 squares.
%H A371014 Amiram Eldar, <a href="/A371014/b371014.txt">Table of n, a(n) for n = 1..10000</a>
%F A371014 Multiplicative with a(p^e) = floor(e/2) + 1 if p == 3 (mod 4), and e+1 otherwise.
%F A371014 a(n) = A000005(n) if and only if n is in A072437.
%F A371014 a(n) = A046951(n) if and only if n is in A004614.
%F A371014 a(n) = 1 if and only if n is in A167181.
%t A371014 f[p_, e_] := If[Mod[p, 4] == 3, Floor[e/2] + 1, e + 1]; a[1] = 1; a[n_] := Times @@ f @@@ FactorInteger[n]; Array[a, 100]
%o A371014 (PARI) a(n) = {my(f = factor(n)); prod(i = 1, #f~, if(f[i, 1]%4 == 3, f[i, 2]\2 + 1, f[i, 2] + 1));}
%Y A371014 Cf. A001481, A004614, A046951, A072437, A167181, A371015.
%K A371014 nonn,easy,mult
%O A371014 1,2
%A A371014 _Amiram Eldar_, Mar 08 2024