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 A256709 #11 Apr 23 2015 13:37:37
%S A256709 509,890,903,905,930,950,960,970,980,990,1039,1091,1095,1097,1390,
%T A256709 1709,1903,1905,1930,1970,1980,1990,2049,2093,2095,2097,2190,2509,
%U A256709 2809,2903,2905,2907,2930,2970,2990,3009,3049,3079,3090,3092,3095,3097,3098,3099,3209
%N A256709 Numbers n such that the decimal expansions of both n and n^2 have 0 as smallest digit and 9 as largest digit.
%H A256709 Felix Fröhlich, <a href="/A256709/b256709.txt">Table of n, a(n) for n = 1..10000</a>
%t A256709 fQ[n_] := Block[{c = DigitCount@ n}, And[c[[9]] > 0, c[[10]] > 0]]; Select[Range@ 3209, fQ@ # && fQ[#^2] &] (* _Michael De Vlieger_, Apr 12 2015 *)
%o A256709 (PARI) is(n) = vecmin(digits(n))==0 && vecmin(digits(n^2))==0 && vecmax(digits(n))==9 && vecmax(digits(n^2))==9
%Y A256709 Cf. A136836, A256630, A256631, A256633, A256634, A256708.
%K A256709 nonn,base
%O A256709 1,1
%A A256709 _Felix Fröhlich_, Apr 08 2015