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 A327599 #14 Sep 28 2019 22:10:34
%S A327599 1,117,775,2793,9801,16093,30927,88723,90675,137541,292537,326781,
%T A327599 488125,732511,796797,954273,1882881,1926183,2164575,2896363,3500157,
%U A327599 3618459,4985713,6725201,7595775,8042167,10380591,12326221,12472075,14076543,16092297,20456373,23968425,25774633
%N A327599 Odd numbers k that have a divisor d such that sigma(d)*d is equal to k.
%C A327599 We need d and sigma(d) odd which happens precisely when d is an odd square.
%H A327599 David A. Corneth, <a href="/A327599/b327599.txt">Table of n, a(n) for n = 1..10000</a>
%e A327599 As 9 * sigma(9) = 9 * (1 + 3 + 9) = 9 * 13 = 117 is odd, 117 is in the sequence.
%t A327599 Select[2Range[0, 9999] + 1, MemberQ[(DivisorSigma[1, #] * # &)/@Divisors[#], #] &] (* _Alonso del Arte_, Sep 18 2019 *)
%o A327599 (PARI) upto(n) = {my(res = List()); forstep(i = 1, sqrtnint(n, 4), 2, c = i^2*sigma(i^2); if(c <= n, listput(res, c))); listsort(res, 1); res}
%Y A327599 Odd terms of A327165.
%Y A327599 Cf. A064987.
%K A327599 nonn
%O A327599 1,2
%A A327599 _David A. Corneth_, Sep 18 2019