|
0, 1, 0, 2, 1, 1, 1, 3, 0, 2, 0, 2, 0, 2, 1, 4, 1, 1, 1, 3, 1, 1, 0, 3, 2, 1, 0, 3, 1, 2, 0, 5, 0, 2, 2, 2, 0, 2, 0, 4, 1, 2, 1, 2, 1, 1, 0, 4, 2, 3, 1, 2, 1, 1, 1, 4, 1, 2, 0, 3, 1, 1, 1, 6, 1, 1, 1, 3, 0, 3, 0, 3, 1, 1, 2, 3, 1, 1, 1, 5, 0, 2, 0, 3, 2, 2, 1, 3, 0, 2, 1, 2, 0, 1, 2, 5
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,4
|
|
LINKS
|
|
|
FORMULA
|
Other identities.
If n = u*v, a(n) = a(u)+a(v).
For all n >= 0, a(2^n) = n.
|
|
PROG
|
(PARI)
default(primelimit, 2^22)
A246269(n) = my(f = factor(n)); for (i=1, #f~, f[i, 1] = (nextprime(f[i, 1]+1)%4)); factorback(f);
for(n=1, 10080, write("b246270.txt", n, " ", A246270(n)));
(Scheme, two definitions)
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|