%I A054038
%S A054038 32043,32286,33144,35172,35337,35757,35853,37176,37905,38772,39147,
%T A054038 39336,40545,42744,43902,44016,45567,45624,46587,48852,49314,49353,
%U A054038 50706,53976,54918,55446,55524,55581,55626,56532,57321,58413,58455
%N A054038 Numbers n such that n^2 contains every digit at least once.
%C A054038 There are 87 terms < 10^5; these are the n such that n^2 uses each digit 
               exactly once. - David Wasserman (dwasserm(AT)earthlink.net), Feb 
               03 2005
%D A054038 J.-M. De Koninck and A. Mercier, 1001 Problemes en Theorie Classique 
               Des Nombres, Problem 239 pp. 39; 178, Ellipses Paris 2004.
%p A054038 f := []; for i from 0 to 200 do if nops({op(convert(i^2,base,10))})=10 
               then f := [op(f),i] fi; od; f;
%Y A054038 Cf. A016069, A054031, A054032, A054033, A054034, A054035, A054036, A054037, 
               A054039.
%Y A054038 Sequence in context: A154471 A140939 A134124 this_sequence A156977 A097282 
               A146896
%Y A054038 Adjacent sequences: A054035 A054036 A054037 this_sequence A054039 A054040 
               A054041
%K A054038 nonn,base
%O A054038 1,1
%A A054038 Asher Auel (asher.auel(AT)reed.edu) Feb 28 2000
%E A054038 More terms from David Wasserman (dwasserm(AT)earthlink.net), Feb 03 2005