login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A039710 a(n) = n-th prime modulo 12. 5
2, 3, 5, 7, 11, 1, 5, 7, 11, 5, 7, 1, 5, 7, 11, 5, 11, 1, 7, 11, 1, 7, 11, 5, 1, 5, 7, 11, 1, 5, 7, 11, 5, 7, 5, 7, 1, 7, 11, 5, 11, 1, 11, 1, 5, 7, 7, 7, 11, 1, 5, 11, 1, 11, 5, 11, 5, 7, 1, 5, 7, 5, 7, 11, 1, 5, 7, 1, 11, 1, 5, 11, 7, 1, 7, 11, 5, 1, 5, 1, 11 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
MAPLE
seq(ithprime(n) mod 12, n=1..100); # Nathaniel Johnston, Jun 29 2011
MATHEMATICA
Table[Mod[Prime[n], 12], {n, 100}] (* Nathaniel Johnston, Jun 29 2011 *)
Mod[Prime[Range[100]], 12] (* Vincenzo Librandi, May 06 2014 *)
PROG
(Sage) [mod(p, 12) for p in primes(500)] # Bruno Berselli, May 05 2014
(Magma) [p mod(12): p in PrimesUpTo(500)]; // Vincenzo Librandi, May 06 2014
CROSSREFS
Sequence in context: A039711 A194261 A194262 * A087173 A179335 A330994
KEYWORD
nonn,easy
AUTHOR
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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 3 23:57 EDT 2023. Contains 363118 sequences. (Running on oeis4.)