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