A359581 a(n) = (-1)^A329697(n).

1, 1, -1, 1, -1, -1, 1, 1, 1, -1, 1, -1, 1, 1, 1, 1, -1, 1, -1, -1, -1, 1, -1, -1, 1, 1, -1, 1, -1, 1, -1, 1, -1, -1, -1, 1, -1, -1, -1, -1, 1, -1, 1, 1, -1, -1, 1, -1, 1, 1, 1, 1, -1, -1, -1, 1, 1, -1, 1, 1, -1, -1, 1, 1, -1, -1, 1, -1, 1, -1, 1, 1, -1, -1, -1, -1, 1, -1, 1, -1, 1, 1, -1, -1, 1, 1, 1, 1, -1, -1, 1, -1, 1, 1, 1, -1, 1, 1, 1, 1, -1, 1, -1, 1, 1

Offset

1

Links

Antti Karttunen, Table of n, a(n) for n = 1..16384

Formula

Fully multiplicative with a(p) = (-1)^A329697(p). [A329697 is totally additive]

a(n) = (-1)^A359583(n) = (-1)^A329697(n).

Prog

(PARI)
A329697(n) = if(!bitand(n, n-1), 0, 1+A329697(n-(n/vecmax(factor(n)[, 1]))));
A359581(n) = ((-1)^A329697(n));

Crossrefs

Cf. A329697, A359583, A359584 (positions of -1's), A359585 (of +1's), A359586 (inverse Möbius transform).

Sequence in context: A358766 A359154 A359166 * A359792 A362927 A362928

Adjacent sequences: A359578 A359579 A359580 * A359582 A359583 A359584

Keyword

sign,mult

Author

Antti Karttunen, Jan 07 2023

Status

approved