|
%I #22 Oct 08 2022 09:45:32
%S 1,3,3,5,4,8,4,8,6,10,5,14,5,10,10,12,6,16,6,17,11,12,6,22,9,13,12,18,
%T 7,25,7,18,13,14,13,28,8,15,14,27,8,27,8,21,20,15,8,33,11,23,16,23,9,
%U 30,16,29,16,17,9,44,9,17,22,26,17,32,10,25,17,32,10
%N Sum of ceiling(sqrt(d)) where d runs through the divisors of n.
%H Amiram Eldar, <a href="/A332932/b332932.txt">Table of n, a(n) for n = 1..10000</a>
%p a:= n-> add(ceil(sqrt(d)), d=numtheory[divisors](n)):
%p seq(a(n), n=1..80); # _Alois P. Heinz_, Mar 02 2020
%t Table[DivisorSum[n,Ceiling[Sqrt[#]]&],{n,80}]
%o (PARI) a(n) = sumdiv(n, d, ceil(sqrt(d))); \\ _Michel Marcus_, Mar 03 2020
%o (Python)
%o from math import isqrt
%o from sympy import divisors
%o def A332932(n): return sum(1+isqrt(d-1) for d in divisors(n,generator=True)) # _Chai Wah Wu_, Jul 28 2022
%Y Cf. A058268, A086671, A332931, A332933, A332934, A332935.
%K nonn
%O 1,2
%A _Harvey P. Dale_, Mar 02 2020
|
