A341345 a(n) = A048673(n) mod 3.

1, 2, 0, 2, 1, 2, 0, 2, 1, 2, 1, 2, 0, 2, 0, 2, 1, 2, 0, 2, 1, 2, 0, 2, 1, 2, 0, 2, 1, 2, 1, 2, 0, 2, 0, 2, 0, 2, 1, 2, 1, 2, 0, 2, 1, 2, 0, 2, 1, 2, 0, 2, 0, 2, 1, 2, 1, 2, 1, 2, 1, 2, 0, 2, 0, 2, 0, 2, 1, 2, 1, 2, 1, 2, 0, 2, 0, 2, 0, 2, 1, 2, 0, 2, 1, 2, 0, 2, 1, 2, 1, 2, 0, 2, 0, 2, 0, 2, 1, 2, 1, 2, 0, 2, 1

Offset: 1

Author

Antti Karttunen, Feb 09 2021

Keywords

• nonn

Links

• Antti Karttunen, Table of n, a(n) for n = 1..65537
• Index entries for sequences computed from indices in prime factorization

Crossrefs

Cf. A003961, A010872, A048673, A292247, A292248, A292251, A292252.

Cf. A007395 (even bisection), A341346 (odd bisection), A341347.

Cf. also A291759, A292243, A292244, A292245, A292246, A292250, A304759, A340376, A340377.

Cf. also A292603.

Programs

PARI

A003961(n) = { my(f=factor(n)); for (i=1, #f~, f[i, 1] = nextprime(f[i, 1]+1)); factorback(f); }; \\ From A003961
A341345(n) = (((A003961(n)+1)/2)%3);

Formula

a(n) = A010872(A048673(n)).

a(n) = 0 iff A292247(n) is odd.

a(n) = 0 iff A292250(n) is odd, or equally, iff both A291759(n) and A304759(n) are even.

a(n) = 0 iff A292251(n) > 0.

a(n) = 1 iff A292248(n) is odd.

a(n) = 1 iff A304759(n) is odd, or equally, iff both A291759(n) and A292250(n) are even.

a(2n) = 2.