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 A347162 #11 Jan 07 2022 15:37:59
%S A347162 0,1,1,1,1,1,1,1,1,1,1,28,1,1,28,1,1,28,1,1,28,1,1,28,1,1,28,1,1,153,
%T A347162 1,1,28,1,126,28,1,1,28,126,1,28,1,1,153,1,1,28,1,126,28,1,1,28,126,
%U A347162 344,28,1,1,153,1,1,371,1,126,28,1,1,28,469,1,28,1,1,153
%N A347162 Sum of cubes of odd divisors of n that are < sqrt(n).
%H A347162 Harvey P. Dale, <a href="/A347162/b347162.txt">Table of n, a(n) for n = 1..1000</a>
%F A347162 G.f.: Sum_{k>=1} (2*k - 1)^3 * x^(2*k*(2*k - 1)) / (1 - x^(2*k - 1)).
%t A347162 Table[DivisorSum[n, #^3 &, # < Sqrt[n] && OddQ[#] &], {n, 1, 75}]
%t A347162 nmax = 75; CoefficientList[Series[Sum[(2 k - 1)^3 x^(2 k (2 k - 1))/(1 - x^(2 k - 1)), {k, 1, nmax}], {x, 0, nmax}], x] // Rest
%t A347162 scod[n_]:=Total[Select[Divisors[n],#<Sqrt[n]&&OddQ[#]&]^3]; Array[scod,80] (* _Harvey P. Dale_, Jan 07 2022 *)
%o A347162 (PARI) a(n) = my(r=sqrt(n)); sumdiv(n, d, if ((d%2) && (d<r), d^3)); \\ _Michel Marcus_, Aug 21 2021
%Y A347162 Cf. A001158, A051000, A333805, A333807, A339354, A347161.
%K A347162 nonn
%O A347162 1,12
%A A347162 _Ilya Gutkovskiy_, Aug 20 2021