A359787 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A359787

Parity of Dirichlet inverse of A075255, where A075255(n) = n - sopfr(n), where sopfr is the sum of prime factors (with repetition).

1, 0, 0, 0, 0, 1, 0, 0, 1, 1, 0, 1, 0, 1, 1, 0, 0, 0, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 0, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 0, 0, 0, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 1, 1, 0, 0, 1, 1, 0, 1, 1, 0, 1

(list; graph; refs; listen; history; text; internal format)

OFFSET

COMMENTS

Note that here a(n) = 1 does not imply that A359768(n) = 1 also. The difference A359768(n) - a(n) can be -1, 0, or +1. This in contrast to sequences like A359774. See also A359816.

LINKS

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

Index entries for characteristic functions

FORMULA

a(n) = A359788(n) mod 2.

PROG

(PARI) A359787(n) = (A359788(n)%2);

CROSSREFS

Cf. A001414, A075255, A359768, A359774, A359788.

Cf. also A359764 [= a(A003961(n))], A359816.

Sequence in context: A181663 A359370 A359768 * A374119 A247223 A186741

Adjacent sequences: A359784 A359785 A359786 * A359788 A359789 A359790

KEYWORD

nonn

AUTHOR

Antti Karttunen, Jan 16 2023

STATUS

approved