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 A332476 #10 Feb 14 2020 03:21:31 %S A332476 1,2,2,2,4,4,2,2,2,8,2,4,4,4,8,2,4,4,2,8,4,4,2,4,4,8,2,4,4,16,2,2,4,8, %T A332476 8,4,4,4,8,8,4,8,2,4,8,4,2,4,2,8,8,8,4,4,8,4,4,8,2,16,4,4,4,2,16,8,2, %U A332476 8,4,16,2,4,4,8,8,4,4,16,2,8,2,8,2,8,16 %N A332476 The number of unitary divisors of n in Gaussian integers. %H A332476 Amiram Eldar, <a href="/A332476/b332476.txt">Table of n, a(n) for n = 1..10000</a> %F A332476 Multiplicative with a(p^e) = 4 if p == 1 (mod 4) and 2 otherwise. %F A332476 a(n) = 2^A086275(n). %e A332476 a(2) = 2 since 2 = -i * (1 + i)^2, so it has 2 unitary divisors (up to associates): 1 and (1 + i)^2. %t A332476 f[p_, e_] := If[Abs[p] == 1, 1, 2]; a[n_] := Times @@ f @@@ FactorInteger[n, GaussianIntegers -> True]; Array[a, 100] %Y A332476 Cf. A034444, A062327, A086275, A332472, A332473, A332474. %K A332476 nonn,mult %O A332476 1,2 %A A332476 _Amiram Eldar_, Feb 13 2020