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 A039711 #33 Dec 12 2024 00:58:37
%S A039711 2,3,5,7,11,0,4,6,10,3,5,11,2,4,8,1,7,9,2,6,8,1,5,11,6,10,12,3,5,9,10,
%T A039711 1,7,9,6,8,1,7,11,4,10,12,9,11,2,4,3,2,6,8,12,5,7,4,10,3,9,11,4,8,10,
%U A039711 7,8,12,1,5,6,12,9,11,2,8,3,9,2,6,12,7,11,6
%N A039711 a(n) = n-th prime modulo 13.
%H A039711 Nathaniel Johnston, <a href="/A039711/b039711.txt">Table of n, a(n) for n = 1..10000</a>
%F A039711 Sum_k={1..n} a(k) ~ (13/2)*n. - _Amiram Eldar_, Dec 11 2024
%p A039711 seq(ithprime(n) mod 13, n=1..100); # _Nathaniel Johnston_, Jun 29 2011
%t A039711 Mod[ Prime@ Range@ 80, 13] (* _Robert G. Wilson v_, Mar 13 2011 *)
%o A039711 (PARI) primes(1000)%13 \\ _Charles R Greathouse IV_, Mar 13 2011
%o A039711 (Sage) [mod(p, 13) for p in primes(500)] # _Bruno Berselli_, May 05 2014
%o A039711 (Magma) [p mod(13): p in PrimesUpTo(500)]; // _Vincenzo Librandi_, May 06 2014
%Y A039711 Cf. A039701-A039706, A038194, A007652, A039709, A039710, A039712-A039715.
%K A039711 nonn,easy
%O A039711 1,1
%A A039711 _Clark Kimberling_