OFFSET
1,1
LINKS
Nathaniel Johnston, Table of n, a(n) for n = 1..10000
FORMULA
By the Prime Number Theorem in Arithmetic Progressions, all nonzero residue classes are equiprobable. In particular, Sum_{k=1..n} a(k) ~ 8.5n. - Charles R Greathouse IV, Apr 16 2012
MAPLE
seq(ithprime(n) mod 17, n=1..100); # Nathaniel Johnston, Jun 29 2011
MATHEMATICA
Table[Mod[Prime[n], 17], {n, 100}] (* Nathaniel Johnston, Jun 29 2011 *)
Mod[Prime[Range[100]], 17] (* Vincenzo Librandi, May 06 2014 *)
PROG
(PARI) primes(100)%17 \\ Charles R Greathouse IV, Apr 16 2012
(Sage) [mod(p, 17) for p in primes(500)] # Bruno Berselli, May 05 2014
(Magma) [p mod(17): p in PrimesUpTo(500)]; // Vincenzo Librandi, May 06 2014
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
STATUS
approved