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

A023097

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

Terms

    a(0) =245a(1) =2985a(2) =525a(3) =1208a(4) =142857a(5) =20a(6) =2970a(7) =21a(8) =3419a(9) =69034a(10) =11220a(11) =24a(12) =459a(13) =9720a(14) =25935a(15) =55a(16) =13671a(17) =88a(18) =52900a(19) =630a(20) =21775a(21) =535483a(22) =22113a(23) =35a(24) =2175a(25) =35520a(26) =1240a(27) =43520a(28) =102795a(29) =204

External references