Voozh

A361113

a(n)=1 if A361102(n) is even, otherwise 0.

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

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

OFFSET

LINKS

Paolo Xausa, Table of n, a(n) for n = 1..10000

MATHEMATICA

A361113list[upto_]:=Join[{0}, 1-Mod[Select[Range[upto], Length[FactorInteger[#]]>1&], 2]]; A361113list[200] (* Paolo Xausa, Oct 11 2023 *)

PROG

(Python)

from sympy import primepi, integer_nthroot

def A361113(n):

def f(x): return int(n+sum(primepi(integer_nthroot(x, k)[0]) for k in range(1, x.bit_length())))

m, k = n, f(n)