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 A112735 #21 Oct 19 2017 03:14:58
%S A112735 4,9,16,49,64,81,289,324,576,841,1156,1444,1521,2209,2809,2916,3249,
%T A112735 3364,3481,3844,4489,5184,6241,7056,8464,8836,24649,24964,29929,34969,
%U A112735 36864,37636,43681,56169,56644,61009,64009,66049,67081,94249,98596
%N A112735 Exclusionary squares.
%C A112735 An exclusionary square m^2 is one sharing no digit in common with its root m made up of distinct digits. The associated root is given by A112736.
%C A112735 The largest term is 639172^2 = 408540845584; and is the seq. because the intersection of {1,2,3,6,7,9} & {0, 4, 5, 8} = {}. Number of terms < 10^n: 2, 6, 10, 26, 41, 71, 84, 121, 129, 140, 141, 142. - _Robert G. Wilson v_, Apr 03 2009
%D A112735 H. Ibstedt, Solution to Problem 2623, "Exclusionary Powers", pp. 346-9, Journal of recreational Mathematics, Vol. 32 No. 4 2003-4 Baywood NY.
%H A112735 Robert G. Wilson v, <a href="/A112735/b112735.txt">Table of n, a(n) for n = 1..142 </a> (full sequence)
%t A112735 fQ[n_] := Intersection[ IntegerDigits[n], IntegerDigits[n^2]] == {}; Select[ Range@ 330, fQ@# &]^2 (* _Robert G. Wilson v_, Apr 03 2009 *)
%Y A112735 Cf. A112322.
%K A112735 nonn,base,fini,full
%O A112735 1,1
%A A112735 _Lekraj Beedassy_, Sep 16 2005
%E A112735 Corrected and extended by _Don Reble_, Nov 22 2006