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 A055018 #15 Jul 13 2013 12:02:30 %S A055018 411,811,1421,2036,2044,2054,3054,4036,4044,4054,8036,12036,16036, %T A055018 20036,24036,28036,32036,40011,40044,50054,50074,80011,88296,100110, %U A055018 100270,100369,120296,120404,140021,144242,176296,200044,200270,200369 %N A055018 Numbers n such that n and n+1 are modest (cf. A054986). %H A055018 Reinhard Zumkeller, <a href="/A055018/b055018.txt">Table of n, a(n) for n = 1..250</a> %e A055018 2036 is modest because Mod[2036, 36] = 20. 2037 is modest because Mod[2037, 037] = 2. Hence 2036 is this pair's modest twin representative. %o A055018 (Haskell) %o A055018 import Data.List (elemIndices) %o A055018 a055018 n = a055018_list !! (n-1) %o A055018 a055018_list = map (a054986 . (+ 1)) $ elemIndices 1 $ %o A055018 zipWith (-) (tail a054986_list) a054986_list %o A055018 -- _Reinhard Zumkeller_, Mar 26 2012 %K A055018 base,easy,nonn %O A055018 1,1 %A A055018 _Hans Havermann_, May 31 2000