A373474 - OEIS

A373474

a(n) = 1 if A001414(n) and A083345(n) are both multiples of 3, otherwise 0, where A001414 is fully additive with a(p) = p, and A083345 is the numerator of the fully additive function with a(p) = 1/p.

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

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

OFFSET

COMMENTS

Differs from A369658 for the first time at n=19683, 157464, 275562, 393660, ..., see A373476.

LINKS

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

Index entries for characteristic functions

Index entries for sequences which agree for a long time but are different

FORMULA

a(n) = [A373363(n) == 0 (mod 3)], where [ ] is the Iverson bracket.

a(3^9 * n) = a(n).

PROG