|
|
A095691
|
|
Multiplicative with a(p^e) = A000720(e)+1.
|
|
9
|
|
|
1, 1, 1, 2, 1, 1, 1, 3, 2, 1, 1, 2, 1, 1, 1, 3, 1, 2, 1, 2, 1, 1, 1, 3, 2, 1, 3, 2, 1, 1, 1, 4, 1, 1, 1, 4, 1, 1, 1, 3, 1, 1, 1, 2, 2, 1, 1, 3, 2, 2, 1, 2, 1, 3, 1, 3, 1, 1, 1, 2, 1, 1, 2, 4, 1, 1, 1, 2, 1, 1, 1, 6, 1, 1, 2, 2, 1, 1, 1, 3, 3, 1, 1, 2, 1, 1, 1, 3, 1, 2, 1, 2, 1, 1, 1, 4, 1, 2, 2, 4, 1, 1, 1, 3, 1
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,4
|
|
COMMENTS
|
|
|
LINKS
|
|
|
FORMULA
|
Asymptotic mean: Limit_{m->oo} (1/m) * Sum_{k=1..m} a(k) = Product_{p prime} (1 + Sum_{q prime} 1/p^q) = Sum_{n>=1} 1/A056166(n) = 1.80728269690724154161... . - Amiram Eldar, Oct 31 2023
|
|
MATHEMATICA
|
Array[Times @@ Map[PrimePi@# + 1 &, FactorInteger[#][[All, -1]] ] &, 120] (* Michael De Vlieger, Jul 19 2017 *)
|
|
PROG
|
(PARI) A095691(n) = { my(f = factor(n), m = 1); for (k=1, #f~, m *= (1+primepi(f[k, 2])); ); m; } \\ Antti Karttunen, Jul 19 2017
(Python)
from sympy import factorint, primepi, prod
def a(n): return 1 if n==1 else prod(primepi(e) + 1 for e in factorint(n).values())
|
|
CROSSREFS
|
|
|
KEYWORD
|
mult,nonn,easy
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|