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!)
A361012 Multiplicative with a(p^e) = sigma(e), where sigma = A000203. 6
1, 1, 1, 3, 1, 1, 1, 4, 3, 1, 1, 3, 1, 1, 1, 7, 1, 3, 1, 3, 1, 1, 1, 4, 3, 1, 4, 3, 1, 1, 1, 6, 1, 1, 1, 9, 1, 1, 1, 4, 1, 1, 1, 3, 3, 1, 1, 7, 3, 3, 1, 3, 1, 4, 1, 4, 1, 1, 1, 3, 1, 1, 3, 12, 1, 1, 1, 3, 1, 1, 1, 12, 1, 1, 3, 3, 1, 1, 1, 7, 7, 1, 1, 3, 1, 1 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,4
LINKS
FORMULA
Dirichlet g.f.: Product_{p prime} (1 + Sum_{e>=1} sigma(e) / p^(e*s)).
Sum_{k=1..n} a(k) ~ c * n, where c = Product_{p prime} (1 + Sum_{e>=2} (sigma(e) - sigma(e-1)) / p^e) = 2.96008030202494141048182047811089469392843909592516341... = A361013
MATHEMATICA
g[p_, e_] := DivisorSigma[1, e]; a[1] = 1; a[n_] := Times @@ g @@@ FactorInteger[n]; Array[a, 100]
PROG
(Python)
from math import prod
from sympy import divisor_sigma, factorint
def A361012(n): return prod(divisor_sigma(e) for e in factorint(n).values()) # Chai Wah Wu, Feb 28 2023
CROSSREFS
Sequence in context: A346403 A295924 A357669 * A363903 A123940 A350447
KEYWORD
nonn,mult
AUTHOR
Vaclav Kotesovec, Feb 28 2023
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 30 22:34 EDT 2024. Contains 375550 sequences. (Running on oeis4.)