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 A052050 #26 May 12 2023 16:27:48
%S A052050 7744,228484,332929,339889,511225,698896,774400,776161,797449,
%T A052050 11303044,11464996,15295921,16621929,22848400,25775929,27447121,
%U A052050 28826161,33292900,33454656,33512521,33988900,34316164,42549529,45643536,45859984,47969476,48177481,50509449,51122500
%N A052050 Squares whose digits occur with an equal minimal frequency of 2.
%C A052050 There are A225428(10)=597959 terms in this sequence. The last term is 99887301530267526144 = 9994363488^2. - _Hugo Pfoertner_, May 12 2023
%H A052050 Patrick De Geest, <a href="http://www.worldofnumbers.com/samedigits.htm">Numbers whose digits occur with same frequency</a>
%t A052050 Select[Table[n^2, {n, 6760}], Union[Last[Transpose[Tally[IntegerDigits[#]]]]] == {2} &] (* _Jayanta Basu_, Jun 17 2013 *)
%o A052050 (Python)
%o A052050 from itertools import islice
%o A052050 from collections import Counter
%o A052050 def afull(): yield from (x**2 for x in range(10**10) if set(Counter(str(x**2)).values()) == {2})
%o A052050 print(list(islice(afull(), 47))) # _Michael S. Branicky_, May 12 2023
%Y A052050 Cf. A052049, A045540, A052046, A052047, A052048, A052051, A052052, A225428.
%K A052050 nonn,base,fini
%O A052050 1,1
%A A052050 _Patrick De Geest_, Dec 15 1999