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 A039709 #33 Dec 12 2024 00:58:08
%S A039709 2,3,5,7,0,2,6,8,1,7,9,4,8,10,3,9,4,6,1,5,7,2,6,1,9,2,4,8,10,3,6,10,5,
%T A039709 7,6,8,3,9,2,8,3,5,4,6,10,1,2,3,7,9,2,8,10,9,4,10,5,7,2,6,8,7,10,3,5,
%U A039709 9,1,7,6,8,1,7,4,10,5,9,4,1,5,2,1,3,2,4,10,3
%N A039709 a(n) = n-th prime modulo 11.
%H A039709 Reinhard Zumkeller, <a href="/A039709/b039709.txt">Table of n, a(n) for n = 1..1000</a>
%F A039709 a(A049084(A137977(n-1))) = even; a(A049084(A137978(n-1))) = odd. - _Reinhard Zumkeller_, Feb 25 2008
%F A039709 Sum_k={1..n} a(k) ~ (11/2)*n. - _Amiram Eldar_, Dec 11 2024
%p A039709 seq(ithprime(n) mod 11, n=1..100); # _Nathaniel Johnston_, Jun 29 2011
%t A039709 Mod[Prime@ Range@ 86, 11] (* _Robert G. Wilson v_ *)
%o A039709 (PARI) primes(1000)%11 \\ _Charles R Greathouse IV_, Mar 13 2011
%o A039709 (Magma) [p mod 11: p in PrimesUpTo(500)]; // _Vincenzo Librandi_, May 06 2014
%Y A039709 Cf. A000040, A039703, A039705, A039710-A039715, A049084, A137977, A137978.
%K A039709 nonn,easy
%O A039709 1,1
%A A039709 _Clark Kimberling_, Dec 11 1999