login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A341345 a(n) = A048673(n) mod 3. 5

%I #22 Feb 11 2021 14:22:09

%S 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 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 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 a(n) = A048673(n) mod 3.

%H Antti Karttunen, <a href="/A341345/b341345.txt">Table of n, a(n) for n = 1..65537</a>

%H <a href="/index/Pri#prime_indices">Index entries for sequences computed from indices in prime factorization</a>

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

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

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

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

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

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

%F a(2n) = 2.

%o (PARI)

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

%o A341345(n) = (((A003961(n)+1)/2)%3);

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

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

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

%Y Cf. also A292603.

%K nonn

%O 1,2

%A _Antti Karttunen_, Feb 09 2021

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 12 03:31 EDT 2024. Contains 375085 sequences. (Running on oeis4.)