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 A197877 #11 Jan 17 2018 17:50:03 %S A197877 2,0,5,6,465,7,16,208,37,17,11,58,40,35,84,18,45,29,395,30,68,59,41, %T A197877 62,32,191,325,109,369,33,89,72,36,85,42,47,64,51,101,88,77,49,125, %U A197877 394,1124,249,76,50,54,65,119,74,2193,61,483,133,80,186,95,990,468 %N A197877 Smallest number m such that A096535(m) = n. %C A197877 A096535(a(n)) = n and A096535(m) <> n for m < a(n), concerning first conjecture in A096535. %H A197877 Reinhard Zumkeller, <a href="/A197877/b197877.txt">Table of n, a(n) for n = 0..9999</a> %e A197877 a(0) = A096274(1) = 2; a(1) = A132678(1) = 0. %o A197877 (Haskell) %o A197877 import Data.List (elemIndex) %o A197877 import Data.Maybe (fromJust) %o A197877 a197877 n = a197877_list !! n %o A197877 a197877_list = map (fromJust . (`elemIndex` a096535_list)) [0..] %K A197877 nonn %O A197877 0,1 %A A197877 _Reinhard Zumkeller_, Oct 19 2011