cp's OEIS Frontend

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

%I A341345 #22 Feb 11 2021 14:22:09
%S A341345 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,
%T A341345 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,
%U A341345 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
%N A341345 a(n) = A048673(n) mod 3.
%H A341345 Antti Karttunen, <a href="/A341345/b341345.txt">Table of n, a(n) for n = 1..65537</a>
%H A341345 <a href="/index/Pri#prime_indices">Index entries for sequences computed from indices in prime factorization</a>
%F A341345 a(n) = A010872(A048673(n)).
%F A341345 a(n) = 0 iff A292247(n) is odd.
%F A341345 a(n) = 0 iff A292250(n) is odd, or equally, iff both A291759(n) and A304759(n) are even.
%F A341345 a(n) = 0 iff A292251(n) > 0.
%F A341345 a(n) = 1 iff A292248(n) is odd.
%F A341345 a(n) = 1 iff A304759(n) is odd, or equally, iff both A291759(n) and A292250(n) are even.
%F A341345 a(2n) = 2.
%o A341345 (PARI)
%o A341345 A003961(n) = { my(f=factor(n)); for (i=1, #f~, f[i, 1] = nextprime(f[i, 1]+1)); factorback(f); }; \\ From A003961
%o A341345 A341345(n) = (((A003961(n)+1)/2)%3);
%Y A341345 Cf. A003961, A010872, A048673, A292247, A292248, A292251, A292252.
%Y A341345 Cf. A007395 (even bisection), A341346 (odd bisection), A341347.
%Y A341345 Cf. also A291759, A292243, A292244, A292245, A292246, A292250, A304759, A340376, A340377.
%Y A341345 Cf. also A292603.
%K A341345 nonn
%O A341345 1,2
%A A341345 _Antti Karttunen_, Feb 09 2021