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 A082052 #11 Nov 30 2019 15:15:47
%S A082052 0,2,3,6,0,11,7,14,3,12,11,27,0,23,18,30,0,29,19,36,10,35,23,59,0,28,
%T A082052 30,55,0,66,31,62,14,36,42,81,0,59,42,84,0,74,43,83,18,71,47,123,7,62,
%U A082052 54,84,0,110,66,119,22,60,59,162,0,95,73,126,0,110,67,108,26,138,71
%N A082052 Sum of divisors of n that are not of the form 4k+1.
%C A082052 a(A004613(n))=0.
%H A082052 Vincenzo Librandi, <a href="/A082052/b082052.txt">Table of n, a(n) for n = 1..10000</a>
%F A082052 G.f.: Sum_{k>=1} x^(2*k)*(2 + 3*x^k + 4*x^(2*k) + 2*x^(4*k) + x^(5*k))/(1 - x^(4*k))^2. - _Ilya Gutkovskiy_, Sep 12 2019
%t A082052 sd[n_]:= Total[Select[Divisors[n], !IntegerQ[(# - 1) / 4]&]]; Array[sd, 100] (* _Vincenzo Librandi_, May 17 2013 *)
%t A082052 Table[DivisorSum[n,#&,(!IntegerQ[(#-1)/4]&)],{n,80}] (* _Harvey P. Dale_, Nov 30 2019 *)
%o A082052 (PARI) for(n=1,100,print1(sumdiv(n,d,if(d%4!=1,d))","))
%Y A082052 Cf. A000203, A050449, A050452, A050460, A078181, A078182, A082053.
%K A082052 nonn,easy
%O A082052 1,2
%A A082052 _Ralf Stephan_, Apr 02 2003