|
|
A226177
|
|
a(n) = mu(n)*d(n), where mu(n) = A008683 and d(n) = A000005.
|
|
6
|
|
|
1, -2, -2, 0, -2, 4, -2, 0, 0, 4, -2, 0, -2, 4, 4, 0, -2, 0, -2, 0, 4, 4, -2, 0, 0, 4, 0, 0, -2, -8, -2, 0, 4, 4, 4, 0, -2, 4, 4, 0, -2, -8, -2, 0, 0, 4, -2, 0, 0, 0, 4, 0, -2, 0, 4, 0, 4, 4, -2, 0, -2, 4, 0, 0, 4, -8, -2, 0, 4, -8, -2, 0, -2, 4, 0, 0, 4, -8, -2, 0, 0, 4, -2, 0, 4, 4, 4, 0, -2, 0, 4, 0, 4, 4, 4, 0, -2, 0, 0, 0, -2, -8, -2, 0, -8
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
The prime numbers are the only solutions to mu(n)*d(n) = -2.
Multiplicative with a(p) = -2, a(p^e) = 0, e > 1.
If n is semiprime, then a(n) = 4 * ( ceiling(sqrt(n)) - floor(sqrt(n)) )
= ( ceiling(sqrt(n)) - floor(sqrt(n)) )*( ceiling(sqrt(n)) - floor(sqrt(n)) + 3 ) = 2 - 2*(-1)^( ceiling(sqrt(n)) - floor(sqrt(n)) ).
|
|
LINKS
|
|
|
FORMULA
|
Sum_{n>0} a(n)/n^s = Product_{p prime} (1 - 2p^(-s)). - Ralf Stephan, Jul 07 2013
a(n) = mu(n) * 2^omega(n) = |mu(n)| * (-2)^omega(n), where omega = A001221. - Álvar Ibeas, Dec 30 2018
|
|
EXAMPLE
|
a(5) = mu(5)*d(5) = (-1)(2) = -2.
|
|
MAPLE
|
with(numtheory); a:=n->mobius(n)*tau(n); seq(a(k), k=1..100);
|
|
MATHEMATICA
|
|
|
PROG
|
(PARI) for(n=1, 100, print1(direuler(p=2, n, (1 - 2*X))[n], ", ")); \\ Vaclav Kotesovec, Aug 21 2021
|
|
CROSSREFS
|
|
|
KEYWORD
|
sign,mult
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|