The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A244738 a(n) = (prime(n) mod 5) mod 3. 4
 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 (list; graph; refs; listen; history; text; internal format)
 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: A219487 A303907 A290870 * A331195 A215462 A025843 Adjacent sequences:  A244735 A244736 A244737 * A244739 A244740 A244741 KEYWORD nonn,easy AUTHOR Clark Kimberling, Jul 05 2014 STATUS approved

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

Last modified December 6 12:38 EST 2021. Contains 349563 sequences. (Running on oeis4.)