|
|
A302050
|
|
An analog of Möbius function (A008683) for nonstandard factorization based on the sieve of Eratosthenes (A083221).
|
|
11
|
|
|
1, -1, -1, 0, -1, 1, -1, 0, 0, 1, -1, 0, -1, 1, 1, 0, -1, 0, -1, 0, 0, 1, -1, 0, 0, 1, 1, 0, -1, -1, -1, 0, 0, 1, 1, 0, -1, 1, 1, 0, -1, 0, -1, 0, 0, 1, -1, 0, 0, 0, 0, 0, -1, -1, 0, 0, 0, 1, -1, 0, -1, 1, 1, 0, 1, 0, -1, 0, 0, -1, -1, 0, -1, 1, 1, 0, 1, -1, -1, 0, 0, 1, -1, 0, 0, 1, -1, 0, -1, 0, 0, 0, 0, 1, 1, 0, -1, 0, 1, 0, -1, 0, -1, 0, 0
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1
|
|
LINKS
|
|
|
FORMULA
|
a(1) = 1; for n > 1, if A302045(n) > 1, then a(n) = 0, otherwise a(n) = -1*a(A302044(n)).
|
|
PROG
|
(PARI)
up_to = 65537;
ordinal_transform(invec) = { my(om = Map(), outvec = vector(length(invec)), pt); for(i=1, length(invec), if(mapisdefined(om, invec[i]), pt = mapget(om, invec[i]), pt = 0); outvec[i] = (1+pt); mapput(om, invec[i], (1+pt))); outvec; };
A020639(n) = if(n>1, if(n>n=factor(n, 0)[1, 1], n, factor(n)[1, 1]), 1); \\ From A020639
v078898 = ordinal_transform(vector(up_to, n, A020639(n)));
A000265(n) = (n/2^valuation(n, 2));
(PARI)
\\ Or, using also some of the code from above:
A003961(n) = my(f = factor(n)); for (i=1, #f~, f[i, 1] = nextprime(f[i, 1]+1)); factorback(f); \\ From A003961
|
|
CROSSREFS
|
|
|
KEYWORD
|
sign
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|