login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A377416
Least integer k which, by a process analogous to the Keith numbers, reach k + n.
1
14, 12, 11, 10, 16, 13, 17, 37, 18, 12, 11, 10, 40, 15, 27, 39, 13, 16, 24, 67, 22, 17, 12, 11, 10, 18, 21, 36, 43, 19, 15, 58, 23, 30, 13, 51, 48, 16, 54, 27, 44, 38, 34, 12, 11, 10, 14, 91, 20, 32, 55, 18, 42, 29, 35, 21, 25, 277, 15, 150, 66, 72, 56, 13, 46
OFFSET
0,1
EXAMPLE
a(5) = 13 because 1 + 3 = 4, 3 + 4 = 7, 4 + 7 = 11, 7 + 11 = 18 that is 13 + 5.
MAPLE
with(numtheory): P:=proc(q, h) local a, b, c, j, k, n, t, v; v:=array(1..h); c:=[];
for j from 0 to 59 do for n from 10 to q do a:=n; b:=length(a);
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+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;
fi; od; od; op(c); end: P(10^6, 5000);
CROSSREFS
Sequence in context: A240815 A305938 A206605 * A004503 A340720 A166041
KEYWORD
nonn,easy,base
AUTHOR
Paolo P. Lava, Oct 27 2024
STATUS
approved