100345689

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=26A068805
• a(n) is the smallest k > 0 such that exactly n distinct permutations of the digits of k, all having the same number of digits as k, are perfect squares (no leading zeros allowed).at n=17A387882