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 A195690 #13 Jul 20 2019 11:07:56
%S A195690 2,6,72,76,162,228,230,238,316,434,530,580,686,690,714,716,756,770,
%T A195690 948,994,1034,1054,1216,1302,1358,1490,1590,1740,1778,1836,1870,1996,
%U A195690 2058,2148,2310,2354,2414,2438,2492,2596,2668,2786,2876,2930,2982,3002,3102
%N A195690 Numbers such that the difference between the sum of the even divisors and the sum of the odd divisors is a perfect square.
%C A195690 Numbers k such that A002129(k) is a square.
%H A195690 Amiram Eldar, <a href="/A195690/b195690.txt">Table of n, a(n) for n = 1..10000</a>
%e A195690 The divisors of 76 are { 1, 2, 4, 19, 38, 76}, and (2 + 4 + 38 + 76 ) - (1 + 19 ) = 10^2. Hence 76 is in the sequence.
%p A195690 with(numtheory):for n from 2 by 2 to 200 do:x:=divisors(n):n1:=nops(x):s1:=0:s2:=0:for m from 1 to n1 do:if irem(x[m],2)=1 then s1:=s1+x[m]:else s2:=s2+x[m]:fi:od: z:=sqrt(s2-s1):if z=floor(z) then printf(`%d, `,n): else fi:od:
%t A195690 f[p_, e_] := If[p == 2, 3 - 2^(e + 1) , (p^(e + 1) - 1)/(p - 1)]; aQ[n_] := IntegerQ[Sqrt[-Times @@ (f @@@ FactorInteger[n])]]; Select[Range[2, 3200], aQ] (* _Amiram Eldar_, Jul 20 2019 *)
%Y A195690 Cf. A002129, A195268, A195382.
%K A195690 nonn
%O A195690 1,1
%A A195690 _Michel Lagneau_, Sep 22 2011