A068805 - cp's OEIS frontend

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.

n	a(n)
1	1
2	100
3	169
4	10269
5	13468
6	10044
7	100269
8	1000269
9	10069
10	100069
11	1001466
12	1000044
13	10012689
14	10045669
15	10001466
16	1003468
17	10023469
18	1000069
19	10000069
20	10002456
21	10003468
22	100045669
23	100023469
24	100001466
25	100124469
26	100045678
27	100345689
28	100023489
29	100000069
30	100002456

[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]

cp's OEIS Frontend

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.

Table of values

List of values