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 A258765 #5 Jun 10 2015 06:44:55 %S A258765 0,1,98,3,5,25,8,34,13,44,325,7,22,86,20,11,74,1910,62,122,17,4563, %T A258765 254,19,15,50,117,7174,385,177,29,16,61,69,24,213,51,118,73,56601,41, %U A258765 121,82,23,866,9025,68,43,35,142,135,5005,39,77,106,52,174,5865,70 %N A258765 Smallest m such that |A258057(m)| = n. %C A258765 |A258057(a(n))| = n and |A258057(m)| != n for m < a(n). %H A258765 Reinhard Zumkeller, <a href="/A258765/b258765.txt">Table of n, a(n) for n = 0..177</a> %o A258765 (Haskell) %o A258765 import Data.List (elemIndex); import Data.Maybe (fromJust) %o A258765 a258765 = fromJust . (`elemIndex` (map abs a258057_list)) %Y A258765 Cf. A258057, A003415. %K A258765 nonn %O A258765 0,3 %A A258765 _Reinhard Zumkeller_, Jun 10 2015