OFFSET
1,2
LINKS
Robert Israel, Table of n, a(n) for n = 1..384
FORMULA
a(n) = Sum_{k=1..n} k^n * Sum_{j=1..floor(n/k)} j^n.
MAPLE
f:= proc(n) local k; add(k^n * numtheory:-tau(k), k=1..n) end proc:
map(f, [$1..30]); # Robert Israel, Jan 21 2024
MATHEMATICA
a[n_] := Sum[k^n * DivisorSigma[0, k], {k, 1, n}]; Array[a, 18] (* Amiram Eldar, Jul 30 2022 *)
PROG
(PARI) a(n) = sum(k=1, n, k^n*sigma(k, 0));
(PARI) a(n) = sum(k=1, n, k^n*sum(j=1, n\k, j^n));
(Python)
from math import isqrt
from sympy import bernoulli
def A356239(n): return (-(bernoulli(n+1, (s:=isqrt(n))+1)-(b:=bernoulli(n+1)))**2//(n+1) + sum(k**n*(bernoulli(n+1, n//k+1)-b)<<1 for k in range(1, s+1)))//(n+1) # Chai Wah Wu, Oct 21 2023
CROSSREFS
KEYWORD
nonn
AUTHOR
Seiichi Manyama, Jul 30 2022
STATUS
approved