login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A332934 Sum of round(d^(3/2)) where d runs through the divisors of n. 6

%I #15 Oct 08 2022 09:45:39

%S 1,4,6,12,12,24,20,35,33,47,37,74,48,75,75,99,71,127,84,144,121,143,

%T 111,215,137,184,173,231,157,289,174,280,232,272,238,393,226,321,297,

%U 420,264,463,283,443,404,426,323,612,363,526,440,567,387,664,456,673

%N Sum of round(d^(3/2)) where d runs through the divisors of n.

%H Amiram Eldar, <a href="/A332934/b332934.txt">Table of n, a(n) for n = 1..10000</a>

%p a:= n-> add(round(d^(3/2)), d=numtheory[divisors](n)):

%p seq(a(n), n=1..60); # _Alois P. Heinz_, Mar 02 2020

%t Table[DivisorSum[n,Floor[1/2+Sqrt[#^3]]&],{n,80}]

%o (Python)

%o from math import isqrt

%o from sympy import divisors

%o 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 Cf. A058270, A086671, A332931, A332932, A332933, A332935.

%K nonn

%O 1,2

%A _Harvey P. Dale_, Mar 02 2020

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 18 20:26 EDT 2024. Contains 371781 sequences. (Running on oeis4.)