A039709 a(n) = n-th prime modulo 11.

2, 3, 5, 7, 0, 2, 6, 8, 1, 7, 9, 4, 8, 10, 3, 9, 4, 6, 1, 5, 7, 2, 6, 1, 9, 2, 4, 8, 10, 3, 6, 10, 5, 7, 6, 8, 3, 9, 2, 8, 3, 5, 4, 6, 10, 1, 2, 3, 7, 9, 2, 8, 10, 9, 4, 10, 5, 7, 2, 6, 8, 7, 10, 3, 5, 9, 1, 7, 6, 8, 1, 7, 4, 10, 5, 9, 4, 1, 5, 2, 1, 3, 2, 4, 10, 3

Offset: 1

Author

Clark Kimberling, Dec 11 1999

Keywords

• nonn
• easy

Links

• Reinhard Zumkeller, Table of n, a(n) for n = 1..1000

Crossrefs

Cf. A000040, A039703, A039705, A039710-A039715, A049084, A137977, A137978.

Programs

Magma

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

Maple

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

Mathematica

Mod[Prime@ Range@ 86, 11] (* Robert G. Wilson v *)

PARI

primes(1000)%11 \\ Charles R Greathouse IV, Mar 13 2011

Formula

a(A049084(A137977(n-1))) = even; a(A049084(A137978(n-1))) = odd. - Reinhard Zumkeller, Feb 25 2008

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