This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A186712 #14 Jul 29 2015 04:21:26 %S A186712 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 A186712 45,46,93,94,50,51,53,54,104,105,58,59,111,112,63,116,117,67,68,123, %U A186712 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 A186712 Smallest number m such that A186711(m) = A003586(n). %C A186712 A186711(a(n)) = A003586(n) and A186711(m) != A003586(n) for m < a(n). %H A186712 Reinhard Zumkeller, <a href="/A186712/b186712.txt">Table of n, a(n) for n = 1..10000</a> %e A186712 n = 10: A003586(10) = 18 and A186711(23) = 18 with no preceding occurrences of 18 in A186711. %p A186712 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 A186712 (Haskell) %o A186712 import Data.List (findIndex); import Data.Maybe (fromJust) %o A186712 a186712 n = (+ 1) $ fromJust $ findIndex (== a003586 n) a186711_list %Y A186712 Cf. A003586, A186711. %K A186712 nonn %O A186712 1,2 %A A186712 _Reinhard Zumkeller_, Feb 26 2011