login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A344081
a(n) = Sum_{d|n} tau(d)^d, where tau(n) is the number of divisors of n.
3
1, 5, 9, 86, 33, 4109, 129, 65622, 19692, 1048613, 2049, 2176786526, 8193, 268435589, 1073741865, 152587956247, 131073, 101559956692208, 524289, 3656158441111670, 4398046511241, 17592186046469, 8388609, 4722366482871822065758
OFFSET
1,2
LINKS
FORMULA
G.f.: Sum_{k >= 1} (tau(k) * x)^k/(1 - x^k).
If p is prime, a(p) = 1 + 2^p.
MATHEMATICA
a[n_] := DivisorSum[n, DivisorSigma[0, #]^# &]; Array[a, 24] (* Amiram Eldar, May 09 2021 *)
PROG
(PARI) a(n) = sumdiv(n, d, numdiv(d)^d);
(PARI) my(N=40, x='x+O('x^N)); Vec(sum(k=1, N, (numdiv(k)*x)^k/(1-x^k)))
CROSSREFS
KEYWORD
nonn
AUTHOR
Seiichi Manyama, May 09 2021
STATUS
approved