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 A257078 #5 Apr 17 2015 01:33:37 %S A257078 1,4,3,11,18,13,7,23,39,42,64,27,43,29,15,47,78,141,142,212,278,83, %T A257078 241,55,86,149,150,59,90,61,31,95,158,285,286,541,542,1051,796,931, %U A257078 483,167,485,295,422,171,489,111,174,301,302,557,558,179,497,119,182 %N A257078 Smallest number m such that A248756(m) = n. %C A257078 A248756(a(n)) = n and A248756(m) != n for m < a(n). %H A257078 Reinhard Zumkeller, <a href="/A257078/b257078.txt">Table of n, a(n) for n = 1..1000</a> %o A257078 (Haskell) %o A257078 import Data.List (elemIndex); import Data.Maybe (fromJust) %o A257078 a257078 = (+ 1) . fromJust . (`elemIndex` a248756_list) %Y A257078 Cf. A248756. %K A257078 nonn %O A257078 1,2 %A A257078 _Reinhard Zumkeller_, Apr 15 2015