A374471 - OEIS

A374471

a(n) = 1 if bigomega(n) and A064547(n) are both even, otherwise 0, where A064547 is the count of 1-bits in the exponents of the prime factorization of n, and bigomega is the number of prime factors of n (with multiplicity).

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

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

OFFSET

LINKS

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

Index entries for characteristic functions

Index entries for sequences computed from exponents in factorization of n

FORMULA

a(n) = A065043(n) * A359464(n).

a(n) = A059841(A374470(n)).

PROG

(PARI)

A064547(n) = { my(f = factor(n)[, 2]); sum(k=1, #f, hammingweight(f[k])); };