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 #14 Jul 29 2015 04:21:26
%S 1,4,7,8,10,17,18,14,22,23,25,26,28,29,31,32,34,35,36,38,39,41,42,43,
%T 45,46,93,94,50,51,53,54,104,105,58,59,111,112,63,116,117,67,68,123,
%U 124,72,128,129,131,132,78,136,137,82,141,142,144,145,88,149,150,152,153,155,156,158,159,99,163,164,166,167,169,170,172,173,175,176,178,179
%N Smallest number m such that A186711(m) = A003586(n).
%C A186711(a(n)) = A003586(n) and A186711(m) != A003586(n) for m < a(n).
%H Reinhard Zumkeller, <a href="/A186712/b186712.txt">Table of n, a(n) for n = 1..10000</a>
%e n = 10: A003586(10) = 18 and A186711(23) = 18 with no preceding occurrences of 18 in A186711.
%p A186712 := proc(n) for m from 1 do if A186711(m) = A003586(n) then return m; end if; end do: end proc: # _R. J. Mathar_, Mar 04 2011
%o (Haskell)
%o import Data.List (findIndex); import Data.Maybe (fromJust)
%o a186712 n = (+ 1) $ fromJust $ findIndex (== a003586 n) a186711_list
%Y Cf. A003586, A186711.
%K nonn
%O 1,2
%A _Reinhard Zumkeller_, Feb 26 2011