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 A076410 #9 Feb 25 2015 23:32:42
%S A076410 1,1,2,3,4,4,4,7,6,9,10,10,9,13,13,15,16,14,18,17,19,22,24,25,23,25,
%T A076410 27,28,29,30,34,33,37,34,39,40,36,43,42,45,41,48,49,45,51,52,54,57,58,
%U A076410 52,60,59,64,59,67,62,69,70,69,73,75,68,78,79,81,84,84,87,88,80,87,93,93
%N A076410 (Sum of the quadratic residues of prime(n)) / prime(n).
%C A076410 Always an integer for primes > 3.
%D A076410 Kenneth A. Ribet, Modular forms and Diophantine questions, Challenges for the 21st century (Singapore 2000), 162-182; World Sci. Publishing, River Edge NJ 2001; Math. Rev. 2002i:11030.
%F A076410 a(n) = A076409(n)/prime(n).
%F A076410 a(n) ~= p(n)/4. - _David W. Wilson_, Oct 09 2002
%F A076410 If prime(n) = 4k+1 then a(n) = k.
%t A076410 Table[ Apply[ Plus, Flatten[ Position[ Table[ JacobiSymbol[i, Prime[n]], {i, 1, Prime[n] - 1}], 1]]] /Prime[n], {n, 3, 50}]
%K A076410 nonn
%O A076410 3,3
%A A076410 _R. K. Guy_, Oct 08 2002
%E A076410 Edited and extended by _Robert G. Wilson v_, Oct 09 2002