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 A067975 #4 Jun 15 2014 16:40:39 %S A067975 2,7,43,136,367,1157,1822,3658,5558,6196,9679,10183,11794,17852,20813, %T A067975 28354,32193,42852,53787,55044,55707,55983,57636,58464,61719,70209, %U A067975 95232,96354,96921,96963,101407,114223,114323,133564,162293,170843 %N A067975 a(n+1) is the smallest number > a(n) such that the digits of a(n)^2 are all (with multiplicity) contained in the digits of a(n+1)^2, with a(0)=2. %C A067975 a(n) for n>0 remains the same when a(0)=3. If "contained in" is replaced by "properly contained in" we get A065298. %e A067975 1157^2 = 1338649 and 1822 is the next smallest number whose square (in this case 3319684) contains the digits 1,3,3,8,6,4,9. %Y A067975 Cf. A065297, A014563, A067971, A065298, A067973. %K A067975 base,nonn %O A067975 0,1 %A A067975 _Marc Paulhus_, Feb 05 2002