Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
%I #7 Jun 30 2015 04:55:45
%S 1,6,7,2,12,3,8,20,21,9,4,13,45,14,5,10,22,27,28,23,11,50,15,46,42,47,
%T 16,51,33,24,29,61,60,30,25,34,52,17,48,41,88,105,49,18,53,35,26,31,
%U 67,62,63,68,32,58,36,54,19,91,106,87,111,94,107,90,120,55
%N Smallest m such that A259260(m) = 2*n-1.
%C Sequence is defined for all numbers iff A259260 is a permutation of the odd numbers;
%C A259260(a(n)) = 2*n-1.
%H Reinhard Zumkeller, <a href="/A259526/b259526.txt">Table of n, a(n) for n = 1..10000</a>
%o (Haskell)
%o import Data.List (elemIndex); import Data.Maybe (fromJust)
%o a259526 = (+ 1) . fromJust . (`elemIndex` a259260_list) . subtract 1 . (* 2)
%Y Cf. A259260.
%K nonn
%O 1,2
%A _Reinhard Zumkeller_, Jun 29 2015