A244738 a(n) = (prime(n) mod 5) mod 3.

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

Offset

1,1

Links

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

Example

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

Mathematica

z = 300; u = Mod[Table[Mod[Prime[n], 5], {n, 1, z}], 3] (* A244738 *)
v1 = Flatten[Position[u, 0]]  (* A244739 *)
v2 = Flatten[Position[u, 1]]  (* A024707 *)
v3 = Flatten[Position[u, 2]]  (* A244741 *)
Mod[Mod[Prime[Range[90]], 5], 3] (* Harvey P. Dale, Aug 14 2019 *)

Crossrefs

Cf. A039703, A244739, A024707, A244741, A244735.

Sequence in context: A290870 A353501 A353428 * A331195 A215462 A025843

Adjacent sequences: A244735 A244736 A244737 * A244739 A244740 A244741

Keyword

nonn,easy

Author

Clark Kimberling, Jul 05 2014

Status

approved