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 A039705 #20 Dec 12 2024 00:57:37
%S A039705 2,3,5,0,4,6,3,5,2,1,3,2,6,1,5,4,3,5,4,1,3,2,6,5,6,3,5,2,4,1,1,5,4,6,
%T A039705 2,4,3,2,6,5,4,6,2,4,1,3,1,6,3,5,2,1,3,6,5,4,3,5,4,1,3,6,6,3,5,2,2,1,
%U A039705 4,6,3,2,3,2,1,5,4,5,2,3,6,1,4,6,5,2,1,2,6,1,5,3,4,1,2,6,5,3,5,2,1,4,3,2,4
%N A039705 a(n) = n-th prime modulo 7.
%C A039705 a(A049084(A045370(n-1))) is even; a(A049084(A045415(n-1))) is odd. - _Reinhard Zumkeller_, Feb 25 2008
%H A039705 Reinhard Zumkeller, <a href="/A039705/b039705.txt">Table of n, a(n) for n = 1..1000</a>
%F A039705 Sum_k={1..n} a(k) ~ (7/2)*n. - _Amiram Eldar_, Dec 11 2024
%p A039705 seq(ithprime(n) mod 7, n=1..105); # _Nathaniel Johnston_, Jun 29 2011
%t A039705 Table[Mod[Prime[n], 7], {n, 105}] (* _Nathaniel Johnston_, Jun 29 2011 *)
%t A039705 Mod[Prime[Range[100]], 7] (* _Vincenzo Librandi_, May 06 2014 *)
%o A039705 (Magma) [p mod(7): p in PrimesUpTo(500)]; // _Vincenzo Librandi_, May 06 2014
%o A039705 (PARI) primes(100)%7 \\ _Charles R Greathouse IV_, May 06 2014
%Y A039705 Cf. A039701-A039704, A039706, A038194, A007652, A039709-A039715.
%K A039705 nonn,easy
%O A039705 1,1
%A A039705 _Clark Kimberling_