A110923 Final two digits of prime(n), with leading zero omitted.

2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 1, 3, 7, 9, 13, 27, 31, 37, 39, 49, 51, 57, 63, 67, 73, 79, 81, 91, 93, 97, 99, 11, 23, 27, 29, 33, 39, 41, 51, 57, 63, 69, 71, 77, 81, 83, 93, 7, 11, 13, 17, 31, 37

Offset: 1

Author

Paolo P. Lava, Sep 23 2005

Keywords

• nonn
• base
• easy

Comments

Primes modulo 100.

Links

• Nathaniel Johnston, Table of n, a(n) for n = 1..10000
• Index entries for sequences related to final digits of numbers.

Crossrefs

Cf. A007652, A242119.

Programs

Magma

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

Maple

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

Mathematica

Table[Mod[Prime[n], 100], {n, 100}] (* Ray Chandler, Oct 01 2005 *)
Mod[Prime[Range[100]], 100] (* Vincenzo Librandi, May 07 2014 *)

Sage

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

Formula

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

Extensions

Edited, corrected and extended by Ray Chandler, Oct 01 2005