|
%I #21 Oct 19 2021 23:46:55
%S 1,100,169,10269,13468,10044,100269,1000269,10069,100069,1001466,
%T 1000044,10012689,10045669,10001466,1003468,10023469,1000069,10000069,
%U 10002456,10003468,100045669,100023469,100001466,100124469,100045678,100345689,100023489,100000069,100002456
%N Suppose the integer m has k decimal digits; make a list of the k! strings obtained by permuting the digits in all possible ways; discard any leading zeros; count distinct squares in the list (A062892); a(n) = smallest m that yields n squares.
%H David A. Corneth, <a href="/A068805/b068805.txt">Table of n, a(n) for n = 1..1968</a>
%e a(3) = 169 whose 3 permutations 169, 196 and 961 yield three different squares.
%t a=Table[0, {15}]; Do[b=Count[ IntegerQ /@ Sqrt[ FromDigits /@ Permutations[ IntegerDigits[n]]], True]; If[b<15&&a[[b]]==0, a[[b]]=n], {n, 1, 287618} ] (* _Robert G. Wilson v_, May 22 2003 *)
%Y Cf. A062892, A046891, A046892.
%K base,nonn
%O 1,2
%A _Amarnath Murthy_, Mar 06 2002
%E More terms from _Robert G. Wilson v_, May 22 2003
%E a(13)-a(20) from _John W. Layman_, Sep 27 2004
%E More terms from _David A. Corneth_, Oct 18 2021
|
