The OEIS is supported by the many generous donors to the OEIS 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 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A244735 a(n) = (prime(n) mod 5) mod 2. 6
 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 (list; graph; refs; listen; history; text; internal format)
 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

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.

Last modified December 6 08:36 EST 2022. Contains 358605 sequences. (Running on oeis4.)