login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A242123
a(n) = n-th prime modulo 25.
2
2, 3, 5, 7, 11, 13, 17, 19, 23, 4, 6, 12, 16, 18, 22, 3, 9, 11, 17, 21, 23, 4, 8, 14, 22, 1, 3, 7, 9, 13, 2, 6, 12, 14, 24, 1, 7, 13, 17, 23, 4, 6, 16, 18, 22, 24, 11, 23, 2, 4, 8, 14, 16, 1, 7, 13, 19, 21, 2, 6, 8, 18, 7, 11, 13, 17, 6, 12, 22, 24, 3, 9, 17
OFFSET
1,1
LINKS
FORMULA
Sum_k={1..n} a(k) ~ (25/2)*n. - Amiram Eldar, Dec 12 2024
MATHEMATICA
Mod[Prime[Range[100]], 25]
PROG
(Magma) [p mod(25): p in PrimesUpTo(500)];
(PARI) a(n) = prime(n) % 25; \\ Michel Marcus, May 05 2014
(Sage) [mod(p, 25) for p in primes(500)] # Bruno Berselli, May 05 2014
CROSSREFS
Cf. similar sequences listed in A242119.
Sequence in context: A113580 A242124 A117322 * A229787 A329147 A048380
KEYWORD
nonn,easy
AUTHOR
Vincenzo Librandi, May 05 2014
STATUS
approved