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 A098750 #5 Oct 09 2013 14:20:19 %S A098750 0,10,19,28,36,43,49,55,60,64,68,72,75,78,81,83,85,87,89,91,92,93,94, %T A098750 95,96,97,98,99,100,109,118,127,136,145,154,163,172,181,190,199,208, %U A098750 216,224,232,240,248,256,264,272,280,288,296,304,311,318,325,332,339,346 %N A098750 a(n+1) = a(n) + 10's complement of first digit of a(n); a(0) = 0. %C A098750 0 -> 10 because 0 + (10 - 0) = 10; 10 -> 19 because 10 + (10 - 1) = 19; 19 -> 28 because 19 + (10 - 1) = 28; 28 -> 36 because 28 + (10 - 2) = 36... %C A098750 The number of entries between m*10^k and (m+1)*10^k is approximately (10^k)/(10-m) (for 0<m<10). - _Sam Alexander_, Jan 06 2005 %H A098750 Harvey P. Dale, <a href="/A098750/b098750.txt">Table of n, a(n) for n = 0..1000</a> %t A098750 NestList[#+(10-First[IntegerDigits[#]])&,0,60] (* _Harvey P. Dale_, Oct 04 2012 *) %K A098750 base,easy,nonn %O A098750 0,2 %A A098750 _Eric Angelini_, Oct 01 2004 %E A098750 More terms from _Sam Alexander_, Jan 06 2005