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 A282763 #6 Feb 23 2017 22:54:28
%S A282763 9,20,176,184,277,2669,15705,233202,241202,445657,742714,2095479,
%T A282763 4697536,10508788,20308656,55683878,86603874
%N A282763 8*n analog to Keith numbers.
%C A282763 Like Keith numbers but starting from 8*n digits to reach n.
%C A282763 Consider the digits of 8*n. Take their sum and repeat the process deleting the first addend and adding the previous sum. The sequence lists the numbers that after some iterations reach a sum equal to themselves.
%e A282763 8*20 = 160:
%e A282763 1 + 6 + 0 = 7;
%e A282763 6 + 0 + 7 = 13;
%e A282763 0 + 7 + 13 = 20.
%p A282763 with(numtheory): P:=proc(q, h,w) local a, b, k, n, t, v; v:=array(1..h);
%p A282763 for n from 1 to q do a:=w*n; b:=ilog10(a)+1; if b>1 then
%p A282763 for k from 1 to b do v[b-k+1]:=(a mod 10); a:=trunc(a/10); od; t:=b+1; v[t]:=add(v[k], k=1..b); while v[t]<n do t:=t+1; v[t]:=add(v[k], k=t-b..t-1); od;
%p A282763 if v[t]=n then print(n); fi; fi; od; end: P(10^6, 1000,8);
%t A282763 Select[Range[10^6], Function[n, Module[{d = IntegerDigits[8 n], s, k = 0}, s = Total@ d; While[s < n, AppendTo[d, s]; k++; s = 2 s - d[[k]]]; s == n]]] (* _Michael De Vlieger_, Feb 22 2017, after _T. D. Noe_ at A007629 *)
%Y A282763 Cf. A282757 - A282762, A282764, A282765.
%K A282763 nonn,base
%O A282763 1,1
%A A282763 _Paolo P. Lava_, Feb 22 2017