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 A239627 #4 Mar 31 2014 13:17:27
%S A239627 1,2,1,2,3,3,1,2,1,4,1,3,3,3,4,1,3,3,1,4,2,3,1,3,3,4,1,3,3,5,1,2,2,4,
%T A239627 4,3,3,3,4,3,3,4,1,3,4,3,1,2,1,4,4,4,3,3,4,3,2,4,1,5,3,3,2,2,5,4,1,4,
%U A239627 2,5,1,3,3,4,4,3,2,5,1,4,1,4,1,4,5,3,4
%N A239627 Factored over the Gaussian integers, n has a(n) distinct prime factors, including units -1, i, and -i.
%C A239627 Here -1, i, and -i are counted as factors. The factor 1 is counted only in a(1).
%H A239627 T. D. Noe, <a href="/A239627/b239627.txt">Table of n, a(n) for n = 1..10000</a>
%e A239627 a(2) = 2 because 2 = -i * (1 + i)^2.
%e A239627 a(3) = 1 because 3 is prime over the complex numbers.
%e A239627 a(4) = 2 because 4 = -1 * (1 + i)^4.
%t A239627 Table[Length[FactorInteger[n, GaussianIntegers -> True]], {n, 100}]
%Y A239627 Cf. A001221, A001222 (integer factorizations).
%Y A239627 Cf. A078458, A086275 (Gaussian factorizations).
%Y A239627 Cf. A239626 (Gaussian factorization including units).
%K A239627 nonn
%O A239627 1,2
%A A239627 _T. D. Noe_, Mar 31 2014