%I #9 Oct 31 2024 01:44:22
%S 14,12,11,10,16,13,17,37,18,12,11,10,40,15,27,39,13,16,24,67,22,17,12,
%T 11,10,18,21,36,43,19,15,58,23,30,13,51,48,16,54,27,44,38,34,12,11,10,
%U 14,91,20,32,55,18,42,29,35,21,25,277,15,150,66,72,56,13,46
%N Least integer k which, by a process analogous to the Keith numbers, reach k + n.
%e a(5) = 13 because 1 + 3 = 4, 3 + 4 = 7, 4 + 7 = 11, 7 + 11 = 18 that is 13 + 5.
%p with(numtheory): P:=proc(q,h) local a,b,c,j,k,n,t,v; v:=array(1..h); c:=[];
%p for j from 0 to 59 do for n from 10 to q do a:=n; b:=length(a);
%p 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);
%p while v[t]<n+j do t:=t+1; v[t]:=add(v[k],k=t-b..t-1); od; if v[t]=n+j then c:=[op(c),n]; break;
%p fi; od; od; op(c); end: P(10^6,5000);
%Y Cf. A007629, A377439.
%K nonn,easy,base
%O 0,1
%A _Paolo P. Lava_, Oct 27 2024