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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A039703 a(n) = n-th prime modulo 5. 16
2, 3, 0, 2, 1, 3, 2, 4, 3, 4, 1, 2, 1, 3, 2, 3, 4, 1, 2, 1, 3, 4, 3, 4, 2, 1, 3, 2, 4, 3, 2, 1, 2, 4, 4, 1, 2, 3, 2, 3, 4, 1, 1, 3, 2, 4, 1, 3, 2, 4, 3, 4, 1, 1, 2, 3, 4, 1, 2, 1, 3, 3, 2, 1, 3, 2, 1, 2, 2, 4, 3, 4, 2, 3, 4, 3, 4, 2, 1, 4, 4, 1, 1, 3, 4, 3, 4, 2, 1, 3, 2, 4, 2, 1, 4, 3, 4, 1, 3, 1, 2, 2, 3, 4, 1 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

a(A049084(A045356(n-1))) = even; a(A049084(A045429(n-1))) = odd. - Reinhard Zumkeller, Feb 25 2008

LINKS

R. Zumkeller, Table of n, a(n) for n = 1..1000

MAPLE

seq(ithprime(n) mod 5, n=1..105); # Nathaniel Johnston, Jun 29 2011

MATHEMATICA

Table[Mod[Prime[n], 5], {n, 105}] (* Nathaniel Johnston, Jun 29 2011 *)

Mod[Prime[Range[100]], 5] (* Vincenzo Librandi, May 06 2014 *)

PROG

(PARI) primes(105) % 5 \\ Zak Seidov, Apr 09 2013

(MAGMA) [p mod 5: p in PrimesUpTo(500)]; // Vincenzo Librandi, May 06 2014

CROSSREFS

Cf. A000040, A039701, A039702, A039704-A039706, A038194, A007652, A039709-A039715.

Sequence in context: A068908 A226192 A113407 * A171935 A103180 A308896

Adjacent sequences:  A039700 A039701 A039702 * A039704 A039705 A039706

KEYWORD

nonn,easy

AUTHOR

Clark Kimberling

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 12 06:52 EDT 2021. Contains 344943 sequences. (Running on oeis4.)