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 A039703 #33 Dec 12 2024 09:29:17
%S A039703 2,3,0,2,1,3,2,4,3,4,1,2,1,3,2,3,4,1,2,1,3,4,3,4,2,1,3,2,4,3,2,1,2,4,
%T A039703 4,1,2,3,2,3,4,1,1,3,2,4,1,3,2,4,3,4,1,1,2,3,4,1,2,1,3,3,2,1,3,2,1,2,
%U A039703 2,4,3,4,2,3,4,3,4,2,1,4,4,1,1,3,4,3,4,2,1,3,2,4,2,1,4,3,4,1,3,1,2,2,3,4,1
%N A039703 a(n) = n-th prime modulo 5.
%C A039703 a(A049084(A045356(n-1))) = even; a(A049084(A045429(n-1))) = odd. - _Reinhard Zumkeller_, Feb 25 2008
%H A039703 Reinhard Zumkeller, <a href="/A039703/b039703.txt">Table of n, a(n) for n = 1..1000</a>
%F A039703 Sum_k={1..n} a(k) ~ (5/2)*n. - _Amiram Eldar_, Dec 11 2024
%p A039703 seq(ithprime(n) mod 5, n=1..105); # _Nathaniel Johnston_, Jun 29 2011
%t A039703 Table[Mod[Prime[n], 5], {n, 105}] (* _Nathaniel Johnston_, Jun 29 2011 *)
%t A039703 Mod[Prime[Range[100]], 5] (* _Vincenzo Librandi_, May 06 2014 *)
%o A039703 (PARI) primes(105) % 5 \\ _Zak Seidov_, Apr 09 2013
%o A039703 (Magma) [p mod 5: p in PrimesUpTo(500)]; // _Vincenzo Librandi_, May 06 2014
%Y A039703 Cf. A000040, A010874, A039701, A039702, A039704-A039706, A038194, A007652, A039709-A039715.
%K A039703 nonn,easy
%O A039703 1,1
%A A039703 _Clark Kimberling_