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”).

A107927
Smallest number m>n such that some digit of n and some digit of m sum up to 9.
0
9, 8, 7, 6, 5, 14, 13, 12, 10, 10, 18, 18, 17, 16, 15, 18, 18, 18, 19, 20, 27, 27, 27, 26, 25, 27, 27, 28, 31, 30, 36, 36, 36, 36, 35, 36, 37, 42, 41, 40, 45, 45, 45, 45, 45, 46, 50, 50, 50, 50, 54, 54, 54, 54, 55, 64, 63, 62, 61, 60, 63, 63, 63, 64, 65, 73, 73, 72, 71, 70, 72
OFFSET
0,1
COMMENTS
Cf. A107433 (slowest increasing sequence where some digit of a(n) and some digit of a(n+1) sum up to 9).
MATHEMATICA
bb={}; Do[id1=IntegerDigits[a]; le1=Length[id1]; Do[id2=IntegerDigits[b]; le2=Length[id2]; If[MemberQ[Flatten[Table[id1[[i]]+id2[[j]], {i, le1}, {j, le2}]], 9], bb=Append[bb, b]; Break[]], {b, a+1, 300}], {a, 0, 130}]; bb
CROSSREFS
Cf. A107433.
Sequence in context: A090671 A132673 A363249 * A019890 A066666 A369763
KEYWORD
easy,nonn,base
AUTHOR
Zak Seidov, Jun 10 2005
STATUS
approved