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

Terms

a(0) =32a(1) =18a(2) =8a(3) =350a(4) =480a(5) =21a(6) =104a(7) =125874a(8) =40a(9) =4147a(10) =5712a(11) =65a(12) =15680a(13) =585a(14) =96a(15) =833a(16) =7776a(17) =133a(18) =61600a(19) =46851a(20) =176a(21) =63595a(22) =2232a(23) =225a(24) =106288a(25) =122931a(26) =280a(27) =3857a(28) =91948380a(29) =341