|
|
|
|
0, 2, 3, 4, 4, 5, 5, 6, 6, 6, 5, 7, 5, 7, 7, 8, 6, 8, 7, 8, 8, 7, 7, 9, 8, 7, 9, 9, 7, 9, 7, 10, 8, 8, 9, 10, 7, 9, 8, 10, 8, 10, 9, 9, 10, 9, 8, 11, 10, 10, 9, 9, 9, 11, 9, 11, 10, 9, 8, 11, 9, 9, 11, 12, 9, 10, 9, 10, 10, 11, 8, 12, 9, 9, 11, 11, 10, 10, 9, 12, 12, 10, 9, 12, 10, 11, 10, 11, 8, 12, 10, 11, 10, 10
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
Completely additive because A003961 is fully multiplicative and A064097 is fully additive.
|
|
LINKS
|
|
|
FORMULA
|
a(1) = 0; and for n > 1, a(prime(k)) = A064097(prime(1+k)) for k-th prime, and a(n*m) = a(n) + a(m) if m,n > 1.
|
|
PROG
|
(PARI)
A003961(n) = my(f = factor(n)); for (i=1, #f~, f[i, 1] = nextprime(f[i, 1]+1)); factorback(f);
\\ Or alternatively as:
A334863(n) = { my(f=factor(n)); sum(k=1, #f~, f[k, 2]*A064097(prime(1+primepi(f[k, 1])))); };
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,less
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|