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 A219922 #6 Jul 13 2013 12:04:34 %S A219922 1,3,5,6,7,8,11,9,15,10,19,11,23,29,12,27,16,13,37,20,17,14,24,21,18, %T A219922 28,15,22,19,29,26,16,36,33,20,27,37,17,31,44,21,38,35,25,32,18,29,22, %U A219922 36,46,26,56,40,19,30,23,44,34,27,51,64,31,58,20,97,24 %N A219922 Smallest m such that n is contained in m-th row of A026835. %C A219922 A026835(a(n),k) = n for some k. %H A219922 Reinhard Zumkeller, <a href="/A219922/b219922.txt">Table of n, a(n) for n = 1..180</a> %o A219922 (Haskell) %o A219922 import Data.List (findIndex) %o A219922 import Data.Maybe (fromJust) %o A219922 a219922 n = (fromJust $ findIndex (n `elem`) a026835_tabl) + 1 %K A219922 nonn %O A219922 1,2 %A A219922 _Reinhard Zumkeller_, Dec 01 2012