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 A270544 #18 Apr 15 2016 14:47:02
%S A270544 0,6,10,20,24,34,42,52,56,70,78,88,96,106,114,132,136,146,158,168,176,
%T A270544 194,202,212,220,234,242,260,268,278,294,304,308,326,334,352,364,374,
%U A270544 382,400,408,418,434,444,452,478,486,496,504,518,530,548,556,566,582,600
%N A270544 Number of ordered pairs (i,j) with |i|, |j| <= n, |i * j| <= n, and i odd.
%F A270544 a(n) = 2*floor((n+1)/2) + 4*Sum_{k=0..floor((n+1)/2)-1}floor(n/(2k+1)).
%F A270544 a(n) = A226355(n) - A270543(n).
%e A270544 a(0) = 0 from (i,j) = ().
%e A270544 a(1) = 6 from (i,j) = (-1,+-1), (1,+-1), (+-1,0).
%e A270544 a(2) = 10: (-1,+-2), (-1,+-1), (+-1,0), (1, +-2), (1,+-1).
%t A270544 a[n_] := 2 Floor[(n+1)/2] + 4 Sum[Floor[n/(2k+1)], {k,0,Floor[(n+1)/2]-1}]
%o A270544 (PARI) a(n) = {my(nb = 0); for(i=-n, n, if ((i % 2), for(j=-n, n, if (abs(i*j) <= n, nb++);););); nb;} \\ _Michel Marcus_, Apr 10 2016
%Y A270544 The corresponding sequence where i is even is A270543.
%K A270544 nonn
%O A270544 0,2
%A A270544 _Lorenz H. Menke, Jr._, Mar 18 2016