a(n) is least k such that k and 10k are anagrams in base n (written in base 10).
A023102
a(n) is least k such that k and 10k are anagrams in base n (written in base 10).
Terms
- a(0) =1440a(1) =255486a(2) =34640a(3) =40495a(4) =4480a(5) =68200a(6) =352a(7) =9690a(8) =508a(9) =89965817a(10) =40a(11) =12866a(12) =430782a(13) =467774a(14) =392360a(15) =950a(16) =1170a(17) =35235a(18) =39172a(19) =40600a(20) =44800a(21) =93a(22) =51424a(23) =96074a(24) =1507118a(25) =1820a(26) =1876a(27) =3367a(28) =159562a(29) =4144647
External references
- oeis: A023102