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 A332934 #15 Oct 08 2022 09:45:39
%S A332934 1,4,6,12,12,24,20,35,33,47,37,74,48,75,75,99,71,127,84,144,121,143,
%T A332934 111,215,137,184,173,231,157,289,174,280,232,272,238,393,226,321,297,
%U A332934 420,264,463,283,443,404,426,323,612,363,526,440,567,387,664,456,673
%N A332934 Sum of round(d^(3/2)) where d runs through the divisors of n.
%H A332934 Amiram Eldar, <a href="/A332934/b332934.txt">Table of n, a(n) for n = 1..10000</a>
%p A332934 a:= n-> add(round(d^(3/2)), d=numtheory[divisors](n)):
%p A332934 seq(a(n), n=1..60); # _Alois P. Heinz_, Mar 02 2020
%t A332934 Table[DivisorSum[n,Floor[1/2+Sqrt[#^3]]&],{n,80}]
%o A332934 (Python)
%o A332934 from math import isqrt
%o A332934 from sympy import divisors
%o A332934 def A332934(n): return sum((m:=isqrt(r:=d**3))+int(r-m*(m+1)>=1) for d in divisors(n,generator=True)) # _Chai Wah Wu_, Aug 03 2022
%Y A332934 Cf. A058270, A086671, A332931, A332932, A332933, A332935.
%K A332934 nonn
%O A332934 1,2
%A A332934 _Harvey P. Dale_, Mar 02 2020