This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A033633 #19 Dec 12 2024 09:29:03
%S A033633 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 A033633 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 A033633 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 A033633 a(n) = n-th prime modulo 19.
%H A033633 Vincenzo Librandi, <a href="/A033633/b033633.txt">Table of n, a(n) for n = 1..1000</a>
%F A033633 a(n) = A000040(n) mod 19.
%F A033633 Sum_k={1..n} a(k) ~ (19/2)*n. - _Amiram Eldar_, Dec 12 2024
%t A033633 Mod[Prime[Range[100]], 19] (* _Vincenzo Librandi_, May 07 2014 *)
%o A033633 (Magma) [p mod(19): p in PrimesUpTo(500)]; // _Vincenzo Librandi_, May 07 2014
%Y A033633 Cf. similar sequences listed in A242119.
%K A033633 nonn,easy
%O A033633 1,1
%A A033633 Armand Turpel (armand_t(AT)yahoo.com)