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”).
%I #19 Dec 12 2024 09:29:03
%S 2,3,5,7,11,13,17,0,4,10,12,18,3,5,9,15,2,4,10,14,16,3,7,13,2,6,8,12,
%T 14,18,13,17,4,6,16,18,5,11,15,2,8,10,1,3,7,9,2,14,18,1,5,11,13,4,10,
%U 16,3,5,11,15,17,8,3,7,9,13,8,14,5,7,11,17,6,12,18,3,9,17,2,10
%N a(n) = n-th prime modulo 19.
%H Vincenzo Librandi, <a href="/A033633/b033633.txt">Table of n, a(n) for n = 1..1000</a>
%F a(n) = A000040(n) mod 19.
%F Sum_k={1..n} a(k) ~ (19/2)*n. - _Amiram Eldar_, Dec 12 2024
%t Mod[Prime[Range[100]], 19] (* _Vincenzo Librandi_, May 07 2014 *)
%o (Magma) [p mod(19): p in PrimesUpTo(500)]; // _Vincenzo Librandi_, May 07 2014
%Y Cf. similar sequences listed in A242119.
%K nonn,easy
%O 1,1
%A Armand Turpel (armand_t(AT)yahoo.com)