OFFSET
1,2
COMMENTS
a(n) is the smallest term not yet in the sequences such that A007953(a(n)) == A010888(n) (mod 10). - R. J. Mathar, Oct 05 2017
EXAMPLE
The first string is 1,2,...,9; the second string goes from 10 to 18 since 1+0 is congruent to 1 (mod 10) and 1+8 is congruent to 9 (mod 10); the third string goes from 29 to 27 since 2+9 is congruent to 1 (mod 10) and 2+7 is congruent to 9 (mod 10), etc.
MAPLE
A285054 := proc(n)
option remember;
local a, i, known ;
if n = 1 then
1;
else
for a from 2 do
known := false ;
for i from 1 to n-1 do
if procname(i) = a then
known := true;
break;
end if;
end do:
if not known then
if modp(digsum(a), 10) = A010888(n) then
return a;
end if;
end if;
end do:
end if;
end proc:
seq(A285054(n), n=1..200) ; # R. J. Mathar, Oct 05 2017
CROSSREFS
KEYWORD
nonn,base
AUTHOR
Enrique Navarrete, Sep 11 2017
STATUS
approved