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”).

A229787
a(n) = n-th prime modulo 24.
2
2, 3, 5, 7, 11, 13, 17, 19, 23, 5, 7, 13, 17, 19, 23, 5, 11, 13, 19, 23, 1, 7, 11, 17, 1, 5, 7, 11, 13, 17, 7, 11, 17, 19, 5, 7, 13, 19, 23, 5, 11, 13, 23, 1, 5, 7, 19, 7, 11, 13, 17, 23, 1, 11, 17, 23, 5, 7, 13, 17, 19, 5, 19, 23, 1, 5, 19, 1, 11, 13, 17, 23, 7, 13, 19, 23, 5, 13, 17, 1, 11, 13, 23, 1, 7
OFFSET
1,1
LINKS
FORMULA
Sum_k={1..n} a(k) ~ 12*n. - Amiram Eldar, Dec 12 2024
MATHEMATICA
Mod[Prime[Range[100]], 24] (* Vincenzo Librandi, May 07 2014 *)
PROG
(PARI) a(n) = prime(n) % 24; \\ Joerg Arndt, Oct 01 2013
(Magma) [p mod(24): p in PrimesUpTo(500)]; // Vincenzo Librandi, May 07 2014
CROSSREFS
Cf. similar sequences listed in A242119.
Sequence in context: A242124 A117322 A242123 * A329147 A048380 A048382
KEYWORD
nonn,easy
AUTHOR
Freimut Marschner, Sep 29 2013
STATUS
approved