A039704 a(n) = n-th prime modulo 6.

2, 3, 5, 1, 5, 1, 5, 1, 5, 5, 1, 1, 5, 1, 5, 5, 5, 1, 1, 5, 1, 1, 5, 5, 1, 5, 1, 5, 1, 5, 1, 5, 5, 1, 5, 1, 1, 1, 5, 5, 5, 1, 5, 1, 5, 1, 1, 1, 5, 1, 5, 5, 1, 5, 5, 5, 5, 1, 1, 5, 1, 5, 1, 5, 1, 5, 1, 1, 5, 1, 5, 5, 1, 1, 1, 5, 5, 1, 5, 1, 5, 1, 5, 1, 1, 5, 5, 1, 5, 1, 5, 5, 1, 5, 1, 5, 5, 5, 1, 1, 1, 5, 5, 5, 1

Offset

1,1

Links

Nathaniel Johnston, Table of n, a(n) for n = 1..10000

Maple

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

Mathematica

Table[Mod[Prime[n], 6], {n, 105}] (* Nathaniel Johnston, Jun 29 2011 *)
Mod[Prime[Range[100]], 6] (* Vincenzo Librandi, May 06 2014 *)

Prog

(PARI) primes(105)%6 \\ Zak Seidov, Mar 25 2012
(Magma) [p mod 6: p in PrimesUpTo(500)]; // Vincenzo Librandi, May 06 2014

Crossrefs

Cf. A000040, A039701-A039703, A039705, A039706, A038194, A007652, A039709-A039715.

Sequence in context: A110879 A016587 A123217 * A002752 A239693 A256655

Adjacent sequences: A039701 A039702 A039703 * A039705 A039706 A039707

Keyword

nonn,easy

Author

Clark Kimberling

Status

approved