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 A226091 #4 May 26 2013 15:40:51 %S A226091 1,2,3,4,5,7,9,11,13,15,22,24,26,28,30,37,39,41,43,45,52,54,56,58,60, %T A226091 67,69,71,73,75,87,89,91,93,95,107,109,111,113,115,127,129,131,133, %U A226091 135,147,149,151,153,155,167,169,171,173,175,262,264,266,268,270 %N A226091 Smallest m such that A225985(m) = A014261(n). %C A226091 A225985(a(n)) = A014261(n). %H A226091 Reinhard Zumkeller, <a href="/A226091/b226091.txt">Table of n, a(n) for n = 1..10000</a> %o A226091 (Haskell) %o A226091 import Data.List (elemIndex) %o A226091 import Data.Maybe (fromJust) %o A226091 a226091 = (+ 1) . fromJust . (`elemIndex` a225985_list) . a014261 %K A226091 nonn,base %O A226091 1,2 %A A226091 _Reinhard Zumkeller_, May 26 2013