1000269

Appears in sequences

• 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.at n=7A068805
• Numbers being the smallest positive integer having its digits (Cf. A179239) from which two digits can be chosen, the difference being any value from 0 to 9.at n=20A365375