OFFSET
1,2
COMMENTS
For background references see A330570.
LINKS
Amiram Eldar, Table of n, a(n) for n = 1..10000
MATHEMATICA
s[1] = 1; s[n_] := Module[{e = FactorInteger[n][[;; , 2]]}, If[IntegerQ[Surd[n, 3]], 1/3, 0] + (Times @@ ((e + 1)*(e + 2)/2))/6 + (Times @@ (Floor[e/2] + 1))/2]; Accumulate[Array[s, 100]] (* Amiram Eldar, Apr 19 2024 *)
PROG
(Python)
from math import isqrt
from sympy import integer_nthroot
def A331072(n):
c = (m:=integer_nthroot(n, 3)[0])*(m**2+2)+3*sum(-(s:=isqrt(r:=n//i))**2+(sum(r//k for k in range(1, s+1))<<1)-sum(n//(i*j) for j in range(1, m+1)) for i in range(1, m+1))
j = 1
while j**2 <= n:
k = n//j**2
c += 3*k*(-j+(j:=isqrt(n//k)+1))
return c//6 # Chai Wah Wu, May 28 2026
CROSSREFS
KEYWORD
nonn
AUTHOR
N. J. A. Sloane, Jan 10 2020
STATUS
approved
