OFFSET
0,2
LINKS
Chai Wah Wu, Table of n, a(n) for n = 0..48
MATHEMATICA
a[n_]:=Sum[MoebiusMu[k]*(Floor[2^n/k]^4-Floor[(2^n-1)/k]^4), {k, 2^n}]; Array[a, 21, 0] (* James C. McMahon, May 10 2025 *)
PROG
(Python)
from functools import lru_cache
@lru_cache(maxsize=None)
def A082540(n):
if n == 0:
return 0
c, j = 1, 2
k1 = n//j
while k1 > 1:
j2 = n//k1 + 1
c += (j2-j)*A082540(k1)
j, k1 = j2, n//j2
return n*(n**3-1)-c+j
(PARI) a(n) = sum(k=1, 2^n, moebius(k) * ((2^n\k)^4 - ((2^n-1)\k)^4)); \\ Michel Marcus, May 10 2025
CROSSREFS
KEYWORD
nonn
AUTHOR
Chai Wah Wu, May 09 2025
STATUS
approved
