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