%I #3 May 18 2015 11:33:05
%S 1,4,5,17,6,43,7,206,10,15,343,168,341,1636,1496,1577,526,2463,809,
%T 3640,5455,16183,33073,5261,4480,6679,3678,18286,29268,9970,16293,
%U 86706,51917,29328,106123,48123,5513,54326,10814,24362,128961,43695,35671,53900,97291,24028,129173,60751,86574,250333,80525,62243,65362,71986,77650,675846,16119,380911,245146,90632,71766,353564,508042,237403
%N Smallest m such that A258062(m) = n.
%C A258062(a(n)) = n and A258062(m) != n for m < a(n).
%o (Haskell)
%o import Data.List (elemIndex); import Data.Maybe (fromJust)
%o a258063 = (+ 1) . fromJust . (`elemIndex` a258062_list)
%Y Cf. A258062, A188967.
%K nonn
%O 1,2
%A _Reinhard Zumkeller_, May 18 2015