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 A054036 #17 Oct 27 2023 22:00:46
%S A054036 3206,3267,3268,3292,3674,3678,3698,3723,3734,4047,4097,4157,4175,
%T A054036 4455,4537,4554,4616,4634,4663,4804,4814,4896,4913,4967,4987,5376,
%U A054036 5529,5699,5742,5853,5899,5904,5905,5968,6043,6071,6095,6098,6127,6176,6181,6199
%N A054036 Numbers n such that n^2 contains exactly 8 different digits.
%H A054036 John Cerkan, <a href="/A054036/b054036.txt">Table of n, a(n) for n = 1..10000</a>
%e A054036 3206 is in the sequence because 3206^2 = 10278436 and 10278436 contains exactly eight different digits: 0, 1, 2, 3, 4, 6, 7 and 8.
%p A054036 f := []; for i from 0 to 200 do if nops({op(convert(i^2,base,10))})=8 then f := [op(f),i] fi; od; f;
%t A054036 Select[Range[7000],Count[DigitCount[#^2],0]==2&] (* _Harvey P. Dale_, Aug 10 2017 *)
%Y A054036 Cf. A016069, A054031, A054032, A054033, A054034, A054035, A054037, A054038, A054039, A235723.
%K A054036 nonn,base
%O A054036 1,1
%A A054036 _Asher Auel_, Feb 28 2000