A039713 a(n) = n-th prime modulo 15.

2, 3, 5, 7, 11, 13, 2, 4, 8, 14, 1, 7, 11, 13, 2, 8, 14, 1, 7, 11, 13, 4, 8, 14, 7, 11, 13, 2, 4, 8, 7, 11, 2, 4, 14, 1, 7, 13, 2, 8, 14, 1, 11, 13, 2, 4, 1, 13, 2, 4, 8, 14, 1, 11, 2, 8, 14, 1, 7, 11, 13, 8, 7, 11, 13, 2, 1, 7, 2, 4, 8, 14, 7, 13, 4, 8, 14, 7

Offset

1,1

Links

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

Formula

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

Maple

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

Mathematica

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

Prog

(Sage) [mod(p, 15) for p in primes(500)] # Bruno Berselli, May 05 2014
(Magma) [p mod(15): p in PrimesUpTo(500)]; // Vincenzo Librandi, May 06 2014

Crossrefs

Cf. A039701-A039706, A038194, A007652, A039709-A039712, A039714, A039715.

Sequence in context: A193063 A039715 A039714 * A142713 A039712 A072700

Adjacent sequences: A039710 A039711 A039712 * A039714 A039715 A039716

Keyword

nonn,easy

Author

Clark Kimberling

Status

approved