This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 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. 0
 1, 100, 169, 10269, 13468, 10044, 100269, 1000269, 10069, 100069, 1001466, 1000044, 10012689, 10045669, 10001466, 1003468, 10023469, 1000069, 10000069, 10002456 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS Terms from Robert G. Wilson v. LINKS EXAMPLE a(3) = 169 whose 3 permutations 169, 196 and 961 yield three different squares. 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 *) CROSSREFS Cf. A062892, A046891, A046892. Sequence in context: A004264 A025411 A025408 * A231088 A104023 A072367 Adjacent sequences:  A068802 A068803 A068804 * A068806 A068807 A068808 KEYWORD base,nonn AUTHOR Amarnath Murthy, Mar 06 2002 EXTENSIONS More terms from Robert G. Wilson v, May 22 2003 a(13)-a(20) from John W. Layman, Sep 27 2004 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified May 25 12:30 EDT 2019. Contains 323568 sequences. (Running on oeis4.)