Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
%I #29 Dec 12 2024 09:29:38
%S 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,
%T 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,
%U 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
%N a(n) = n-th prime modulo 24.
%H Freimut Marschner, <a href="/A229787/b229787.txt">Table of n, a(n) for n = 1..1900</a>
%F Sum_k={1..n} a(k) ~ 12*n. - _Amiram Eldar_, Dec 12 2024
%t Mod[Prime[Range[100]], 24] (* _Vincenzo Librandi_, May 07 2014 *)
%o (PARI) a(n) = prime(n) % 24; \\ _Joerg Arndt_, Oct 01 2013
%o (Magma) [p mod(24): p in PrimesUpTo(500)]; // _Vincenzo Librandi_, May 07 2014
%Y Cf. similar sequences listed in A242119.
%K nonn,easy
%O 1,1
%A _Freimut Marschner_, Sep 29 2013