A167831 - OEIS

A167831

Largest m<=n such that no carry occurs when adding m to n in decimal arithmetic.

0, 1, 2, 3, 4, 4, 3, 2, 1, 0, 10, 11, 12, 13, 14, 14, 13, 12, 11, 10, 20, 21, 22, 23, 24, 24, 23, 22, 21, 20, 30, 31, 32, 33, 34, 34, 33, 32, 31, 30, 40, 41, 42, 43, 44, 44, 43, 42, 41, 40, 49, 48, 47, 46, 45, 44, 43, 42, 41, 40, 39, 38, 37, 36, 35, 34, 33, 32, 31, 30, 29, 28, 27

(list; graph; refs; listen; history; text; internal format)

OFFSET

0,3

COMMENTS

A167832(n) = a(n) + n.

LINKS

R. Zumkeller, Table of n, a(n) for n = 0..9999

PROG

(Haskell)

a167831 n = head [x | let ds = a031298_row n, x <- [n, n-1 ..],

all (< 10) $ zipWith (+) ds (a031298_row x)]

-- Reinhard Zumkeller, Mar 15 2014