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 A292202 #21 Sep 12 2017 02:46:27
%S A292202 2,8,15,28,25,33,59,77,90,79,109,111,134,137,129,148,184,189,218,197,
%T A292202 204,226,250,231,284,284,297,313,325,309,341,398,354,418,418,414,488,
%U A292202 440,438,478,529,465,545,554,531,628,658,561,620,677,624,697,697,657,785,818,735,865,835,762,851,851
%N A292202 The n-th iteration of A062028 starting with n.
%C A292202 a(n) == n*2^n (mod 9). This has a period of 18. - _Robert Israel_, Sep 11 2017
%H A292202 Robert Israel, <a href="/A292202/b292202.txt">Table of n, a(n) for n = 1..10000</a>
%H A292202 Robert Israel, <a href="/A292202/a292202.png">Plot of a(n)/n for n = 1 .. 4000</a>
%e A292202 n=5: 5+5=10, 10+1+0=11, 11+1+1=13, 13+1+3=17, 17+1+7=25. After 5 iterations you get 25, so a(5)=25.
%p A292202 A062028:= proc(t) option remember; t + convert(convert(t,base,10),`+`):end proc:
%p A292202 seq((A062028@@n)(n), n=1..100); # _Robert Israel_, Sep 11 2017
%t A292202 Table[Nest[# + Total@ IntegerDigits@ # &, n, n], {n, 62}] (* _Michael De Vlieger_, Sep 11 2017 *)
%o A292202 (PARI) a(n) = my(x=n); for (k=1, n, x += sumdigits(x)); x; \\ _Michel Marcus_, Sep 12 2017
%Y A292202 Cf. A007618, A006507, A062028, A016096.
%K A292202 nonn,base,look
%O A292202 1,1
%A A292202 _Peter Weiss_, Sep 11 2017