|
%I #15 Mar 31 2017 22:22:04
%S 0,11,10,9,8,7,6,5,4,3,2,1,132,143,142,141,140,139,138,137,136,135,
%T 134,133,120,131,130,129,128,127,126,125,124,123,122,121,108,119,118,
%U 117,116,115,114,113,112,111,110,109,96,107,106,105,104,103,102,101,100,99
%N Base-12 complement of n (write n in base 12, then replace each digit with its base-12 negative).
%H Reinhard Zumkeller, <a href="/A055122/b055122.txt">Table of n, a(n) for n = 0..20735</a> (20735 = 12^4 - 1)
%H <a href="/index/Per#IntegerPermutation">Index entries for sequences that are permutations of the natural numbers</a>
%o (Haskell)
%o a055122 0 = 0
%o a055122 n = if d == 0 then 12 * a055122 n' else 12 * a055122 n' + 12 - d
%o where (n', d) = divMod n 12
%o -- _Reinhard Zumkeller_, Mar 12 2014
%Y Cf. A004488, A048647, A055115-A055126.
%Y Column k=12 of A248813.
%K base,easy,nonn
%O 0,2
%A _Henry Bottomley_, Apr 19 2000
|
