The OEIS is supported by the many generous donors to the OEIS Foundation.
%I #16 Oct 26 2019 02:39:50
%S 1,1113,2224,3335,4446,5557,6668,7779,8890,2,114,225,336,447,558,669,
%T 780,891,1002,1114,1225,1336,1447,1558,1669,1780,1891,2002,2113,2225,
%U 2336,2447,2558,2669,2780,2891,3002,3113,3224,3336,3447,3558,3669,3780,3891
%N Inverse permutation to A190016: lexicographical ordering of integers 1 .. 10^4.
%C a(A190016(n)) = A190016(a(n)) = n.
%H Reinhard Zumkeller, <a href="/A190017/b190017.txt">Table of n, a(n) for n = 1..10000</a> (full sequence)
%o (Haskell)
%o import Data.List (elemIndex)
%o import Data.Maybe (fromJust)
%o a190017 n = a190017_list !! (n-1)
%o a190017_list =
%o map (succ . fromJust . (`elemIndex` a190016_list)) [1..10000]
%o (PARI) A190017=vecsort(A190016=vecsort(vector(10^4,n,Str(n)),,1),,1) \\ _M. F. Hasler_, Oct 26 2019
%Y Cf. A190016 (inverse: integers 1..10^4 in lexicographical order).
%Y Cf. A119589, A119590 (integers 1..100 in lexicographical order, and inverse).
%K nonn,base,fini,full
%O 1,2
%A _Reinhard Zumkeller_, May 06 2011