|
|
|
|
0, 0, 1, 0, 1, 1, 1, 0, 2, 1, 1, 1, 1, 1, 2, 0, 1, 2, 2, 1, 2, 1, 1, 1, 2, 1, 3, 1, 2, 2, 1, 0, 2, 1, 2, 2, 2, 2, 2, 1, 1, 2, 2, 1, 3, 1, 1, 1, 2, 2, 2, 1, 2, 3, 2, 1, 3, 2, 2, 2, 1, 1, 3, 0, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 3, 2, 2, 2, 2, 1, 4, 1, 1, 2, 2, 2, 3, 1, 2, 3, 2, 1, 2, 1, 3, 1, 1, 2, 3, 2, 2, 2, 1, 1, 3
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,9
|
|
COMMENTS
|
|
|
LINKS
|
|
|
FORMULA
|
a(2) = 0, a(p) = A334097(p+1)-A064415(p-1) for odd primes p, a(m*n) = a(m)+a(n), if m,n > 1.
a(3^k) = k for all k>= 0.
|
|
PROG
|
(PARI)
A064415(n) = { my(f=factor(n)); sum(k=1, #f~, if(2==f[k, 1], f[k, 2], f[k, 2]*A064415(f[k, 1]-1))); };
A334097(n) = { my(f=factor(n)); sum(k=1, #f~, if(2==f[k, 1], f[k, 2], f[k, 2]*A334097(f[k, 1]+1))); };
\\ Or alternatively as:
A334862(n) = { my(f=factor(n)); sum(k=1, #f~, if(2==f[k, 1], 0, f[k, 2]*(A334097(f[k, 1]+1)-A064415(f[k, 1]-1)))); };
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|