A244735 a(n) = (prime(n) mod 5) mod 2.

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, 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, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 1, 1, 0, 1

Offset

1

Links

Clark Kimberling, Table of n, a(n) for n = 1..2000

Formula

(prime(n) mod 5) mod 2.

Example

n ... prime(n) mod 5 mod 2
1 ..... 2 ..... 2 ... 0
2 ..... 3 ..... 3 ... 1
3 ..... 5 ..... 0 ... 0
4 ..... 7 ..... 2 ... 0
5 ..... 11 .... 1 ... 1
6 ..... 13 .... 3 ... 1

Maple

A244735:=n->(ithprime(n) mod 5) mod 2: seq(A244735(n), n=1..100); # Wesley Ivan Hurt, Jul 06 2014

Mathematica

z = 300; u = Mod[Table[Mod[Prime[n], 5], {n, 1, z}], 2] (* A244735 *)
Flatten[Position[u, 0]]  (* A244736 *)
Flatten[Position[u, 1]]  (* A244737 *)
Mod[Mod[Prime[Range[90]], 5], 2] (* Harvey P. Dale, Jul 22 2020 *)

Crossrefs

Cf. A039703, A244736, A244737.

Sequence in context: A078580 A059651 A286339 * A245938 A176405 A084091

Adjacent sequences: A244732 A244733 A244734 * A244736 A244737 A244738

Keyword

nonn,easy

Author

Clark Kimberling, Jul 05 2014

Status

approved