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 A355498 #20 Sep 21 2022 00:36:45
%S A355498 1,3,6,9,15,18,28,30,36,45,66,60,91,84,90,100,153,126,190,150,168,198,
%T A355498 276,210,225,273,270,280,435,315,496,360,396,459,420,441,703,570,546,
%U A355498 540,861,588,946,660,675,828,1128,756,784,825,918,910,1431,945,990,1008,1140,1305,1770
%N A355498 a(n) = A000217(A033676(n)) * A000217(A033677(n)).
%C A355498 When n squares are arranged in a rectangular grid which is as nearly square as possible, a(n) represents the count of rectangles in the grid. The whole grid itself must be a rectangle too.
%e A355498 For n=10, the grid as nearly square as possible is 2*5. Thus a(10)=3*15=45 is the number of rectangles in this grid.
%t A355498 Table[(# (# + 1)/2) &[
%t A355498 First[Select[Divisors[n], # >= Sqrt[n] &]]] (# (# + 1)/2) &[
%t A355498 Last[Select[Divisors[n], # <= Sqrt[n] &]]], {n, 80}]
%o A355498 (PARI) t(n) = n*(n+1)/2; \\ A000217
%o A355498 largdiv(n) = if(n<2, 1, my(d=divisors(n)); d[(length(d)+1)\2]); \\ A033676
%o A355498 a(n) = my(d=largdiv(n)); t(d)*t(n/d); \\ _Michel Marcus_, Jul 18 2022
%Y A355498 Cf. A000217, A033676, A033677.
%K A355498 nonn
%O A355498 1,2
%A A355498 _Steven Lu_, Jul 04 2022