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