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 A282761 #6 Feb 23 2017 22:54:17
%S A282761 9,23,85,88,208,953,12339,122420,251925,286400,467608,1207360,1308519,
%T A282761 1537214,1638373,1844108,2314739,2736742,9331102,11692851,28349534,
%U A282761 85403569
%N A282761 6*n analog to Keith numbers.
%C A282761 Like Keith numbers but starting from 6*n digits to reach n.
%C A282761 Consider the digits of 6*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 A282761 6*23 = 138:
%e A282761 1 + 3 + 8 = 12;
%e A282761 3 + 8 + 12 = 23.
%p A282761 with(numtheory): P:=proc(q, h,w) local a, b, k, n, t, v; v:=array(1..h);
%p A282761 for n from 1 to q do a:=w*n; b:=ilog10(a)+1; if b>1 then
%p A282761 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 A282761 if v[t]=n then print(n); fi; fi; od; end: P(10^6, 1000,6);
%t A282761 Select[Range[10^6], Function[n, Module[{d = IntegerDigits[6 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 A282761 Cf. A282757 - A282760, A282762 - A282765.
%K A282761 nonn,base
%O A282761 1,1
%A A282761 _Paolo P. Lava_, Feb 22 2017