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