Voozh

A361115

a(n)=1 if A361102(n) is divisible by 3, otherwise 0.

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

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

OFFSET

LINKS

Table of n, a(n) for n=0..92.

PROG

(Python)

from sympy import primepi, integer_nthroot

def A361115(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)

while m != k: m, k = k, f(k)

return int(not m%3) # Chai Wah Wu, Dec 05 2025