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!)
A003973 Inverse Möbius transform of A003961; a(n) = sigma(A003961(n)), where A003961 shifts the prime factorization of n one step towards the larger primes. 85
1, 4, 6, 13, 8, 24, 12, 40, 31, 32, 14, 78, 18, 48, 48, 121, 20, 124, 24, 104, 72, 56, 30, 240, 57, 72, 156, 156, 32, 192, 38, 364, 84, 80, 96, 403, 42, 96, 108, 320, 44, 288, 48, 182, 248, 120, 54, 726, 133, 228, 120, 234, 60, 624, 112, 480, 144, 128, 62, 624, 68 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
Sum of the divisors of the prime shifted n, or equally, sum of the prime shifted divisors of n. - Antti Karttunen, Aug 17 2020
LINKS
Charles R Greathouse IV, Table of n, a(n) for n = 1..10000
FORMULA
Multiplicative with a(p^e) = (q^(e+1)-1)/(q-1) where q = nextPrime(p). - David W. Wilson, Sep 01 2001
From Antti Karttunen, Aug 06-12 2020: (Start)
a(n) = Sum_{d|n} A003961(d) = Sum_{d|A003961(n)} d.
a(n) = A000203(A003961(n)) = A000593(A003961(n)).
a(n) = 2*A336840(n) - A000005(n) = 2*Sum_{d|n} (A048673(d) - (1/2)).
a(n) = A008438(A108228(n)) = A008438(A048673(n)-1).
a(n) = A336838(n) * A336856(n).
a(n) is odd if and only if n is a square.
(End)
Sum_{k=1..n} a(k) ~ c * n^3, where c = (1/2) * Product_{p prime} p^3/((p+1)*(p^2-nextprime(p))) = 3.39513795..., where nextprime is A151800. - Amiram Eldar, Dec 08 2022
MATHEMATICA
b[1] = 1; b[p_?PrimeQ] := b[p] = Prime[ PrimePi[p] + 1]; b[n_] := b[n] = Times @@ (b[First[#]]^Last[#] &) /@ FactorInteger[n]; a[n_] := Sum[ b[d], {d, Divisors[n]}]; Table[a[n], {n, 1, 70}] (* Jean-François Alcover, Jul 18 2013 *)
PROG
(PARI) aPrime(p, e)=my(q=nextprime(p+1)); (q^(e+1)-1)/(q-1)
a(n)=my(f=factor(n)); prod(i=1, #f~, aPrime(f[i, 1], f[i, 2])) \\ Charles R Greathouse IV, Jul 18 2013
(PARI) A003973(n) = { my(f = factor(n)); for(i=1, #f~, f[i, 1] = nextprime(f[i, 1]+1)); sigma(factorback(f)); }; \\ Antti Karttunen, Aug 06 2020
(Python)
from math import prod
from sympy import factorint, nextprime
def A003973(n): return prod(((q:=nextprime(p))**(e+1)-1)//(q-1) for p, e in factorint(n).items()) # Chai Wah Wu, Jul 05 2022
CROSSREFS
Cf. A000203, A000290 (positions of odd terms), A003961, A007814, A048673, A108228, A151800, A295664, A336840.
Permutation of A008438.
Used in the definitions of the following sequences: A326042, A336838, A336841, A336844, A336846, A336847, A336848, A336849, A336850, A336851, A336852, A336856, A336931, A336932.
Cf. also A003972.
Sequence in context: A028444 A341525 A354363 * A341636 A349129 A034747
KEYWORD
nonn,easy,mult
AUTHOR
EXTENSIONS
More terms from David W. Wilson, Aug 29 2001
Secondary name added by Antti Karttunen, Aug 06 2020
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 March 19 04:26 EDT 2024. Contains 370952 sequences. (Running on oeis4.)