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 A226323 #14 Aug 02 2019 03:24:42
%S A226323 1,9,17,25,33,41,57,65,73,81,97,105,121,129,145,161,169,177,193,201,
%T A226323 217,233,249,257,273,281,297,305,321,329,361,369,377,393,409,425,441,
%U A226323 449,465,481,497,505,537,545,561,577,593,601,617,625,641,657,673,681,697
%N A226323 Number of ordered pairs (i,j) with |i| * |j| <= n and gcd(i,j) <= 1.
%C A226323 Note that gcd(0,m) = m for any m.
%H A226323 Alois P. Heinz, <a href="/A226323/b226323.txt">Table of n, a(n) for n = 0..1000</a>
%F A226323 a(n) = 4*A064608(n) + 5 for n > 0, a(0)=1. - _Alois P. Heinz_, Jun 03 2013
%p A226323 with(numtheory):
%p A226323 a:= n-> `if`(n=0, 1, 5+4*add(mobius(k)^2*floor(n/k), k=1..n)):
%p A226323 seq(a(n), n=0..100); # _Alois P. Heinz_, Jun 03 2013
%t A226323 f[n_] := Length[Complement[Union[Flatten[Table[If[Abs[i]*Abs[j] ≤ n && GCD[i, j] ≤ 1, {i, j}], {i, -n, n}, {j, -n, n}], 1]], {Null}]]; Table[f[n], {n, 0, 100}]
%Y A226323 Cf. A064608, A100449.
%K A226323 nonn
%O A226323 0,2
%A A226323 _Robert Price_, Jun 03 2013