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 A258827 #6 Jun 11 2015 17:39:30 %S A258827 1,4,6,5,10,7,2,8,12,9,20,11,13,3,16,14,35,15,36,17,18,19,21,23,30,24, %T A258827 38,25,26,29,39,33,37,34,31,22,43,41,44,32,42,40,50,47,45,28,27,46,49, %U A258827 48,51,53,74,52,59,54,63,55,56,58,84,57,62,65,60,64,69 %N A258827 Smallest m such that A258767(m) = n. %C A258827 If A258767 is a permutation, this sequence is its inverse. %H A258827 Reinhard Zumkeller, <a href="/A258827/b258827.txt">Table of n, a(n) for n = 1..10000</a> %o A258827 (Haskell) %o A258827 import Data.List (elemIndex); import Data.Maybe (fromJust) %o A258827 a258827 = (+ 1) . fromJust . (`elemIndex` a258767_list) %Y A258827 Cf. A258767, A258768 (fixed points). %K A258827 nonn %O A258827 1,2 %A A258827 _Reinhard Zumkeller_, Jun 11 2015