a(n) is the least k > 0 such that k and 3k are anagrams in base n (written in base 10).

Terms

a(0) =75a(1) =142a(2) =315a(3) =12a(4) =819a(5) =84a(6) =1035a(7) =15a(8) =198a(9) =2766a(10) =9555a(11) =56a(12) =315a(13) =8352a(14) =20893a(15) =45a(16) =950a(17) =22000a(18) =819a(19) =132a(20) =63204a(21) =24492a(22) =114075a(23) =91a(24) =2646a(25) =938a(26) =30015a(27) =240a(28) =182807a(29) =118592