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 A071933 #19 Apr 06 2019 04:09:30
%S A071933 1,0,1,2,3,2,3,4,5,4,3,4,5,4,5,6,7,6,7,8,9,8,7,8,9,8,7,8,9,8,9,10,11,
%T A071933 10,11,12,13,12,13,14,15,14,13,14,15,14,13,14,15,14,15,16,17,16,15,16,
%U A071933 17,16,15,16,17,16,17,18,19,18,19,20,21,20,21,22,23,22,21,22,23,22,23
%N A071933 a(n) = Sum_{i=1..n} K(i,i+1), where K(x,y) is the Kronecker symbol (x/y).
%H A071933 G. C. Greubel, <a href="/A071933/b071933.txt">Table of n, a(n) for n = 1..5000</a>
%F A071933 a(n) = n/4 + O(n), asymptotically. [Perhaps O(n) should be o(n)? - _N. J. A. Sloane_, Mar 26 2019]
%F A071933 In fact we have a(n) = n/4 + O(log(n)). More precisely let c(n)=A037800(n) then we get a(8n)=2n+2+2c(n), a(8n+1)=2n+3+2c(n), a(8n+2)=2n+2+2c(n), a(8n+3)=2n+2+2c(n)+(-1)^n, a(8n+4)=2n+3+2c(n)+(-1)^n, a(8n+5)=2n+4+2c(n)+(-1)^n, a(8n+6)=2n+3+2c(n)+(-1)^n, a(8n+7)=2n+3+2c(n+1). - _Benoit Cloitre_, Mar 30 2019
%t A071933 Table[Sum[KroneckerSymbol[j, j+1], {j, 1, n}], {n, 1, 80}] (* _G. C. Greubel_, Mar 17 2019 *)
%o A071933 (PARI) for(n=1,100,print1(sum(i=1,n,kronecker(i,i+1)),","))
%o A071933 (Sage) [sum(kronecker_symbol(j,j+1) for j in (1..n)) for n in (1..80)] # _G. C. Greubel_, Mar 17 2019
%Y A071933 Cf. A071932, A071934.
%K A071933 easy,nonn
%O A071933 1,4
%A A071933 _Benoit Cloitre_, Jun 14 2002