|
|
A353354
|
|
Inverse Möbius transform of A332823.
|
|
17
|
|
|
0, 1, -1, 0, 1, 0, -1, 0, 0, 1, 1, 0, -1, 0, 0, 1, 1, 0, -1, 0, -1, 1, 1, -1, 0, 0, 0, 0, -1, 1, 1, 0, 0, 1, 0, 0, -1, 0, -1, 1, 1, -1, -1, 0, 0, 1, 1, 0, 0, 0, 0, 0, -1, 1, 1, -1, -1, 0, 1, 0, -1, 1, 0, 0, 0, 1, 1, 0, 0, 1, -1, 0, 1, 0, 0, 0, 0, -1, -1, 1, -1, 1, 1, 0, 1, 0, -1, 1, -1, 0, -1, 0, 0, 1, 0, 0, 1, 0, 0, 0, -1, 1, 1, -1, -1
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1
|
|
COMMENTS
|
a(n) is determined by the cubefree part of n, and has the range {-1, 0, 1}.
Proof: A332823 is the scaled imaginary part of a completely multiplicative function, f, from the positive integers to the Eisenstein integers (the range of f being the cube roots of unity). Let g be the inverse Moebius transform of f, which is therefore multiplicative. As a function, "scaling the imaginary part" is a homomorphism with respect to addition, so (a(n)) -- being the inverse Moebius transform of A332823 -- is a scaled imaginary part of g. We can show the range of g is the 7 Eisenstein integers closest to 0, namely the 6 sixth roots of unity and 0 itself. We deduce (a(n)) has the range {-1, 0, 1} (in contrast to say, A353364).
See A353446, which is twice the real part of g, for further details.
|
|
LINKS
|
|
|
FORMULA
|
For all n >= 1, a(A003961(n)) = -a(n); and for all m >= 1, a(n*m^3) = a(n).
|
|
PROG
|
(PARI)
A332823(n) = { my(f = factor(n), u=(sum(k=1, #f~, f[k, 2]*2^primepi(f[k, 1]))/2)%3); if(2==u, -1, u); };
|
|
CROSSREFS
|
Somewhat analogous sequence: A353364.
|
|
KEYWORD
|
sign
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|