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!)
A244735 a(n) = (prime(n) mod 5) mod 2. 6

%I #14 Apr 21 2021 04:21:53

%S 0,1,0,0,1,1,0,0,1,0,1,0,1,1,0,1,0,1,0,1,1,0,1,0,0,1,1,0,0,1,0,1,0,0,

%T 0,1,0,1,0,1,0,1,1,1,0,0,1,1,0,0,1,0,1,1,0,1,0,1,0,1,1,1,0,1,1,0,1,0,

%U 0,0,1,0,0,1,0,1,0,0,1,0,0,1,1,1,0,1

%N a(n) = (prime(n) mod 5) mod 2.

%H Clark Kimberling, <a href="/A244735/b244735.txt">Table of n, a(n) for n = 1..2000</a>

%F (prime(n) mod 5) mod 2.

%e n ... prime(n) mod 5 mod 2

%e 1 ..... 2 ..... 2 ... 0

%e 2 ..... 3 ..... 3 ... 1

%e 3 ..... 5 ..... 0 ... 0

%e 4 ..... 7 ..... 2 ... 0

%e 5 ..... 11 .... 1 ... 1

%e 6 ..... 13 .... 3 ... 1

%p A244735:=n->(ithprime(n) mod 5) mod 2: seq(A244735(n), n=1..100); # _Wesley Ivan Hurt_, Jul 06 2014

%t z = 300; u = Mod[Table[Mod[Prime[n], 5], {n, 1, z}], 2] (* A244735 *)

%t Flatten[Position[u, 0]] (* A244736 *)

%t Flatten[Position[u, 1]] (* A244737 *)

%t Mod[Mod[Prime[Range[90]],5],2] (* _Harvey P. Dale_, Jul 22 2020 *)

%Y Cf. A039703, A244736, A244737.

%K nonn,easy

%O 1

%A _Clark Kimberling_, Jul 05 2014

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 March 29 00:26 EDT 2024. Contains 371264 sequences. (Running on oeis4.)