a(n) is the largest number m in base n such that the digits of the pair (m, 2*m) use every digit in base n exactly once; a(n) = 0 if no such number exists.

A389533

a(n) is the largest number m in base n such that the digits of the pair (m, 2*m) use every digit in base n exactly once; a(n) = 0 if no such number exists.

Terms

    a(0) =0a(1) =0a(2) =6a(3) =14a(4) =0a(5) =223a(6) =1953a(7) =6036a(8) =48651a(9) =0a(10) =1465849a(11) =4608378a(12) =0a(13) =0a(14) =2127254040a(15) =6730515944a(16) =0a(17) =313220703669

External references