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 A193582 #7 Jul 13 2013 12:04:14 %S A193582 0,1,1,1,1,1,1,1,1,1,2,1,1,1,1,1,1,1,1,1,2,2,1,1,1,1,1,1,1,1,2,2,2,1, %T A193582 1,1,1,1,1,1,2,2,2,2,1,1,1,1,1,1,2,2,2,2,2,1,1,1,1,1,3,2,2,2,2,2,1,1, %U A193582 1,1,3,3,2,2,2,2,2,1,1,1,3,3,3,2,2,2 %N A193582 Persistence of n for sort-and-subtract (A193581). %C A193582 Number of sort-and-subtract steps to reach 0 when starting with n. %H A193582 Reinhard Zumkeller, <a href="/A193582/b193582.txt">Table of n, a(n) for n = 0..10000</a> %o A193582 (Haskell) %o A193582 a193582 n = length $ takeWhile (> 0) $ iterate a193581 n %o A193582 a193582_list = map a193582 [0..] %Y A193582 Cf. A004185. %K A193582 nonn,base %O A193582 0,11 %A A193582 _Reinhard Zumkeller_, Aug 10 2011