A039714 a(n) = n-th prime modulo 16.

2, 3, 5, 7, 11, 13, 1, 3, 7, 13, 15, 5, 9, 11, 15, 5, 11, 13, 3, 7, 9, 15, 3, 9, 1, 5, 7, 11, 13, 1, 15, 3, 9, 11, 5, 7, 13, 3, 7, 13, 3, 5, 15, 1, 5, 7, 3, 15, 3, 5, 9, 15, 1, 11, 1, 7, 13, 15, 5, 9, 11, 5, 3, 7, 9, 13, 11, 1, 11, 13, 1, 7, 15, 5, 11, 15, 5

Offset: 1

Author

Clark Kimberling

Keywords

• nonn
• easy

Links

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

Crossrefs

Cf. A039701-A039706, A038194, A007652, A039709-A039713, A039715.

Programs

Magma

[p mod(16): p in PrimesUpTo(500)]; // Vincenzo Librandi, May 06 2014

Maple

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

Mathematica

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

Sage

[mod(p, 16) for p in primes(500)] # Bruno Berselli, May 05 2014

Formula

Sum_k={1..n} a(k) ~ 8*n. - Amiram Eldar, Dec 12 2024