A039711 a(n) = n-th prime modulo 13.
2, 3, 5, 7, 11, 0, 4, 6, 10, 3, 5, 11, 2, 4, 8, 1, 7, 9, 2, 6, 8, 1, 5, 11, 6, 10, 12, 3, 5, 9, 10, 1, 7, 9, 6, 8, 1, 7, 11, 4, 10, 12, 9, 11, 2, 4, 3, 2, 6, 8, 12, 5, 7, 4, 10, 3, 9, 11, 4, 8, 10, 7, 8, 12, 1, 5, 6, 12, 9, 11, 2, 8, 3, 9, 2, 6, 12, 7, 11, 6
Offset: 1
Links
- Nathaniel Johnston, Table of n, a(n) for n = 1..10000
Programs
-
Magma
[p mod(13): p in PrimesUpTo(500)]; // Vincenzo Librandi, May 06 2014
-
Maple
seq(ithprime(n) mod 13, n=1..100); # Nathaniel Johnston, Jun 29 2011
-
Mathematica
Mod[ Prime@ Range@ 80, 13] (* Robert G. Wilson v, Mar 13 2011 *)
-
PARI
primes(1000)%13 \\ Charles R Greathouse IV, Mar 13 2011
-
Sage
[mod(p, 13) for p in primes(500)] # Bruno Berselli, May 05 2014
Formula
Sum_k={1..n} a(k) ~ (13/2)*n. - Amiram Eldar, Dec 11 2024