a(n) is least k such that k and 9k are anagrams in base n (written in base 10).

Terms

a(0) =1089a(1) =167580a(2) =253638a(3) =2499a(4) =48893a(5) =69034a(6) =315a(7) =6264a(8) =2532609a(9) =36a(10) =14649a(11) =12155a(12) =819a(13) =869a(14) =16974a(15) =39a(16) =570375a(17) =19773a(18) =56322a(19) =42a(20) =1305a(21) =43200a(22) =2852a(23) =59296a(24) =1489686a(25) =1649a(26) =3465a(27) =1809a(28) =2791613a(29) =152