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 A337176 #14 Feb 03 2021 23:39:52
%S A337176 0,1,1,1,1,2,1,2,1,2,1,3,1,2,2,2,1,4,1,4,2,3,1,5,1,3,2,4,1,5,1,4,2,3,
%T A337176 2,5,1,3,2,5,1,6,1,4,3,3,1,7,1,4,2,4,1,6,2,5,2,3,1,8,1,3,3,4,2,6,1,5,
%U A337176 2,5,1,9,1,3,3,5,2,6,1,7,2,3,1,10,2,3,3,6,1,9,2,5
%N A337176 Number of pairs of divisors of n, (d1,d2), such that d1 <= d2 and d1*d2 < sqrt(n).
%C A337176 a(n) = 1 iff n is prime or n is the square of a prime (A000430). - _Bernard Schott_, Jan 30 2021
%F A337176 a(n) = Sum_{d1|n, d2|n} (1 - sign(floor(d1*d2/sqrt(n)))).
%e A337176 a(24) = 5; (1,1), (1,2), (1,3), (1,4), (2,2).
%e A337176 a(25) = 1; (1,1).
%e A337176 a(26) = 3; (1,1), (1,2), (2,2).
%e A337176 a(27) = 2; (1,1), (1,3).
%t A337176 Table[Sum[Sum[(1 - Sign[Floor[(i*k)/Sqrt[n]]]) (1 - Ceiling[n/k] + Floor[n/k]) (1 - Ceiling[n/i] + Floor[n/i]), {i, k}], {k, n}], {n, 80}]
%Y A337176 Cf. A337175.
%K A337176 nonn
%O A337176 1,6
%A A337176 _Wesley Ivan Hurt_, Jan 28 2021