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 A222947 #20 Aug 02 2019 03:42:53
%S A222947 1,7,9,11,15,19,21,27,29,35,37,43,45,51,53,59,61,67,69,75,77,83,85,91,
%T A222947 93,99,101,107,109,115,117,123,125,131,133,139,141,147,149,155,157,
%U A222947 163,165,171,173,179,181,187,189,195,197,203,205,211,213,219,221
%N A222947 Number of distinct sums i+j+k with |i|, |j|, |k|, |i*j*k| <= n and gcd(i,j,k) <= 1.
%C A222947 Note that gcd(0,m) = m for any m.
%H A222947 Robert Price, <a href="/A222947/b222947.txt">Table of n, a(n) for n = 0..100</a>
%t A222947 f[n_] := Length[Complement[Union[Flatten[Table[If[Abs[i*j*k] ≤ n && GCD[i, j, k] <= 1, {i + j + k}], {i, -n, n}, {j, -n, n}, {k, -n, n}], 2]], {Null}]]; Table[f[n], {n, 0, 100}]
%Y A222947 Cf. A226357, A226359, A222945.
%K A222947 nonn
%O A222947 0,2
%A A222947 _Robert Price_, Jun 12 2013