%I #6 Jun 30 2015 04:53:45
%S 1,6,2,3,7,8,4,19,5,9,14,10,24,20,21,25,11,15,16,12,26,22,37,23,27,13,
%T 17,56,18,32,28,42,38,39,43,29,33,51,55,54,50,34,30,44,40,71,41,45,31,
%U 35,57,53,92,52,58,36,68,46,76,72,73,77,47,67,63,59,87
%N Smallest m such that A259542(m) = 2*n-1.
%C Sequence is defined for all n iff A259542 is a permutation of the odd numbers;
%C A259542(a(n)) = 2*n-1.
%H Reinhard Zumkeller, <a href="/A259543/b259543.txt">Table of n, a(n) for n = 1..10000</a>
%o (Haskell)
%o import Data.List (elemIndex); import Data.Maybe (fromJust)
%o a259543 = (+ 1) . fromJust . (`elemIndex` a259542_list) . subtract 1 . (* 2)
%Y Cf. A259542.
%K nonn
%O 1,2
%A _Reinhard Zumkeller_, Jun 30 2015