login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A347718 a(n) = Sum of the divisors of sigma_n(n). 2
1, 6, 56, 448, 6264, 96348, 1559520, 16908804, 391945400, 20553536052, 706019328000, 20210523379200, 519285252355776, 21710734431216480, 1456143373228677120, 25536237889612326912, 1792353900753729655758, 52839150354952425838080, 4154723599066412190910560 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
Daniel Suteu, Table of n, a(n) for n = 1..120 (first 42 terms from Chai Wah Wu)
FORMULA
a(n) = sigma(sigma_n(n)).
a(n) = A000203(A023887(n)). - Michel Marcus, Jan 29 2022
EXAMPLE
a(3) = sigma(sigma_3(3)) = sigma(1^3+3^3) = sigma(28) = 1+2+4+7+14+28 = 56.
MAPLE
a:= n-> (s-> s(s[n](n)))(numtheory[sigma]):
seq(a(n), n=1..20); # Alois P. Heinz, Jan 28 2022
MATHEMATICA
Table[DivisorSigma[1, DivisorSigma[n, n]], {n, 20}]
PROG
(Python)
from math import prod
from collections import Counter
from sympy import factorint
def A347718(n): return prod((q**(r+1)-1)//(q-1) for q, r in sum((Counter(factorint((p**(n*(e+1))-1)//(p**n-1))) for p, e in factorint(n).items()), Counter()).items()) # Chai Wah Wu, Jan 28 2022
CROSSREFS
Sequence in context: A074016 A183513 A277975 * A155613 A183586 A166177
KEYWORD
nonn
AUTHOR
Wesley Ivan Hurt, Jan 28 2022
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 27 05:29 EDT 2024. Contains 375462 sequences. (Running on oeis4.)