|
%I #11 Dec 11 2019 22:08:02
%S 0,1,2,11,3,12,13,56,4,14,15,57,16,58,59,176,5,17,18,60,19,61,62,177,
%T 20,63,64,178,65,179,180,386,6,21,22,66,23,67,68,181,24,69,70,182,71,
%U 183,184,387,25,72,73,185,74,186,187,388,75,188,189,389,190
%N Permutation of {0, ..., 1023} corresponding to lexicographic ordering of numbers with decreasing digits (A009995). Inverse of A263327.
%C For n = 1..1023: A009995(a(n)) = A262557(n).
%C The fixed points and cycles of this permutation (up to reversal the same as for its inverse A263327) are listed in A263355. - _M. F. Hasler_, Dec 11 2019
%H Reinhard Zumkeller, <a href="/A263328/b263328.txt">Table of n, a(n) for n = 0..1023</a>
%o (Haskell)
%o a263328 0 = 0
%o a263328 n = head [x | x <- [1..1023], a009995' x == a262557 n]
%o (PARI) A263328=vecsort(A263327,,1) \\ Does not include a(0)=0. - _M. F. Hasler_, Dec 11 2019
%Y Cf. A009995, A262557, A263327 (inverse), A263329 (fixed points).
%K nonn,fini,full
%O 0,3
%A _Reinhard Zumkeller_, Oct 15 2015
|
