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 A171904 #10 Feb 01 2014 23:08:52 %S A171904 99,110,110,110,110,110,110,110,110,100,11,88,99,99,99,99,99,99,99,99, %T A171904 112,11,77,88,88,88,88,88,88,88,88,112,11,66,77,77,77,77,77,77,77,77, %U A171904 112,11,55,66,66,66,66,66,66,66,66,112,11,44,55,55,55,55,55,55,55,55 %N A171904 Smallest number m such that m and m+n have both at least two identical neighboring digits in their decimal representations. %C A171904 a(n) + n = A171901(k) for some k. %H A171904 R. Zumkeller, <a href="/A171904/b171904.txt">Table of n, a(n) for n = 1..10000</a> %F A171904 A196368(a(n)) + A196368(a(n)+n) = 0. - _Reinhard Zumkeller_, Jan 31 2014 %o A171904 (Haskell) %o A171904 a171904 n = head [m | m <- a171901_list, a196368 (m + n) == 0] %o A171904 -- _Reinhard Zumkeller_, Jan 31 2014 %Y A171904 Cf. A196368, A171901, A171903. %K A171904 base,nonn,look %O A171904 1,1 %A A171904 _Reinhard Zumkeller_, Feb 07 2010