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 A171181 #11 Nov 26 2016 09:54:31 %S A171181 0,0,1,0,2,0,3,0,4,0,5,0,6,0,7,0,8,0,9,0,10,9,11,9,12,9,13,9,14,9,15, %T A171181 9,16,9,17,9,18,9,19,9,20,18,21,18,22,18,23,18,24,18,25,18,26,18,27, %U A171181 18,28,18,29,18,30,27,31,27,32,27,33,27,34,27,35,27,36,27,37,27,38,27,39,27 %N A171181 n followed by (n - sum of digits of n). %H A171181 Harvey P. Dale, <a href="/A171181/b171181.txt">Table of n, a(n) for n = 0..1000</a> %F A171181 If n is even, a(n) = n/2; if n is odd, a(n) = A066568(floor(n/2)). - _Michel Marcus_, Aug 14 2013 %e A171181 a(0) = 0, a(1) = 0 - 0 = 0. %e A171181 a(2) = 1, a(3) = 1 - 1 = 0. %e A171181 a(4) = 2, a(5) = 2 - 2 = 0. %e A171181 a(6) = 3, a(7) = 3 - 3 = 0. %t A171181 Table[{n,n-Total[IntegerDigits[n]]},{n,0,40}]//Flatten (* _Harvey P. Dale_, Nov 26 2016 *) %o A171181 (PARI) a(n) = if (n % 2 == 0, n/2, nn = n\2; d = digits(nn); nn - sum(i=1, #d, d[i]);); \\ _Michel Marcus_, Aug 14 2013 %Y A171181 Interspersion of A001477 and A066568. %K A171181 easy,nonn,base %O A171181 0,5 %A A171181 Marcel Hetkowski Fabeny (marcelfabeny(AT)yahoo.com.br), Dec 04 2009 %E A171181 Edited by _N. J. A. Sloane_, Dec 05 2009