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 A039713 #18 Dec 12 2024 09:29:24
%S A039713 2,3,5,7,11,13,2,4,8,14,1,7,11,13,2,8,14,1,7,11,13,4,8,14,7,11,13,2,4,
%T A039713 8,7,11,2,4,14,1,7,13,2,8,14,1,11,13,2,4,1,13,2,4,8,14,1,11,2,8,14,1,
%U A039713 7,11,13,8,7,11,13,2,1,7,2,4,8,14,7,13,4,8,14,7
%N A039713 a(n) = n-th prime modulo 15.
%H A039713 Nathaniel Johnston, <a href="/A039713/b039713.txt">Table of n, a(n) for n = 1..10000</a>
%F A039713 Sum_k={1..n} a(k) ~ (15/2)*n. - _Amiram Eldar_, Dec 12 2024
%p A039713 seq(ithprime(n) mod 15, n=1..100); # _Nathaniel Johnston_, Jun 29 2011
%t A039713 Table[Mod[Prime[n], 15], {n, 100}] (* _Nathaniel Johnston_, Jun 29 2011 *)
%t A039713 Mod[Prime[Range[100]], 15] (* _Vincenzo Librandi_, May 06 2014 *)
%o A039713 (Sage) [mod(p, 15) for p in primes(500)] # _Bruno Berselli_, May 05 2014
%o A039713 (Magma) [p mod(15): p in PrimesUpTo(500)]; // _Vincenzo Librandi_, May 06 2014
%Y A039713 Cf. A039701-A039706, A038194, A007652, A039709-A039712, A039714, A039715.
%K A039713 nonn,easy
%O A039713 1,1
%A A039713 _Clark Kimberling_