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

A387882

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

Terms

    a(0) =1a(1) =144a(2) =169a(3) =10044a(4) =13468a(5) =10069a(6) =1003468a(7) =1000069a(8) =10002456a(9) =11234689a(10) =10234467a(11) =100012669a(12) =100012444a(13) =102344899a(14) =102245679a(15) =100124469a(16) =102234789a(17) =100345689a(18) =102344569a(19) =100024569a(20) =1001223459a(21) =102345678a(22) =1001234569a(23) =1000123569a(24) =1002344679a(25) =1001234689

External references