A068805 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.

1, 100, 169, 10269, 13468, 10044, 100269, 1000269, 10069, 100069, 1001466, 1000044, 10012689, 10045669, 10001466, 1003468, 10023469, 1000069, 10000069, 10002456, 10003468, 100045669, 100023469, 100001466, 100124469, 100045678, 100345689, 100023489, 100000069, 100002456

Offset: 1

Author

Amarnath Murthy, Mar 06 2002

Keywords

• base
• nonn

Examples

			a(3) = 169 whose 3 permutations 169, 196 and 961 yield three different squares.
		

Links

• David A. Corneth, Table of n, a(n) for n = 1..1968

Crossrefs

Cf. A062892, A046891, A046892.

Programs

Mathematica

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 *)

Extensions

More terms from Robert G. Wilson v, May 22 2003

a(13)-a(20) from John W. Layman, Sep 27 2004

More terms from David A. Corneth, Oct 18 2021