A039703 a(n) = n-th prime modulo 5.

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

Offset

1,1

Comments

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

Links

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

Formula

Sum_k={1..n} a(k) ~ (5/2)*n. - Amiram Eldar, Dec 11 2024

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, A010874, 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