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 A216035 #21 Sep 03 2012 14:10:45
%S A216035 9,9,1,9,9,9,25,9,1,9,25,16,9,1,81,1,1,9,9,9,25,49,9,1,9,1,9,25,4,9,9,
%T A216035 49,16,9,49,1,9,81,1,1,9,9,81,25,25,9,9,25,36,49,9,225,1,16,9,49,9,4,
%U A216035 81,1,1,4,9,25,25,9,25,4,36,49,9,9,9,49,16,1,9
%N A216035 Squares corresponding to A215967(n).
%C A216035 This sequence gives the square equal to the absolute value of the difference between the sum of the distinct prime divisors of n that are congruent to 1 mod 4 and the sum of the distinct prime divisors of n that are congruent to 3 mod 4.
%C A216035 The sequence contains subsequences of consecutive squares such as {9,9}, {9,9,9}, {1,1}, {9,9,9}, ..., {121, 121}, ..., {169,169},....
%C A216035 a(A215949(n)) = 0.
%H A216035 Michel Lagneau, <a href="/A216035/b216035.txt">Table of n, a(n) for n = 1..10000</a>
%e A216035 a(35) = 49 because A215967(35) = 2365 = 5*11*43 and (11+43) - 5 = 49 is a square, where {11, 43} == 3 mod 4 and 5 ==1 mod 4.
%p A216035 with(numtheory):for n from 1 to 15000 do:x:=factorset(n):n1:=nops(x):s1:=0:s3:=0:for m from 1 to n1 do: if irem(x[m], 4)=1 then s1:=s1+x[m]:else if irem(x[m], 4)=3 then s3:=s3+x[m]:else fi:fi:od:x:=abs(s1-s3):y:=sqrt(x):if s1>0 and s3>0 and y=floor(y) then printf(`%d, `, x):else fi:od:
%Y A216035 Cf. A215967, A215949.
%K A216035 nonn
%O A216035 1,1
%A A216035 _Michel Lagneau_, Aug 31 2012