Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #12 May 03 2023 09:11:27
%S 1,10,3,5,15,9,7,97,12,280,18,114,31,37,19,16,23,58,90,21,26,32,82,40,
%T 72,104,68,35,33,48,87,47,412,107,66,41,70,38,49,797,1112,42,238,67,
%U 50,991,185,63,62,178,79,260,454,705,69,924,140,250,64,74,161
%N Smallest m such that A065806(m) = n.
%C All integers > 1 occur in A065806, see conjecture there;
%C A065806(a(n)) = n and A065806(m) <> n for m < a(n).
%H Reinhard Zumkeller, <a href="/A241887/b241887.txt">Table of n, a(n) for n = 2..1000</a>
%o (Haskell)
%o import Data.List (elemIndex); import Data.Maybe (fromJust)
%o a241887 = (+ 1) . fromJust . (`elemIndex` a065806_list)
%Y Cf. A065806, A241671.
%K nonn
%O 2,2
%A _Reinhard Zumkeller_, Aug 09 2014