A171904 Smallest number m such that m and m+n have both at least two identical neighboring digits in their decimal representations.

99, 110, 110, 110, 110, 110, 110, 110, 110, 100, 11, 88, 99, 99, 99, 99, 99, 99, 99, 99, 112, 11, 77, 88, 88, 88, 88, 88, 88, 88, 88, 112, 11, 66, 77, 77, 77, 77, 77, 77, 77, 77, 112, 11, 55, 66, 66, 66, 66, 66, 66, 66, 66, 112, 11, 44, 55, 55, 55, 55, 55, 55, 55, 55

Offset: 1

Author

Reinhard Zumkeller, Feb 07 2010

Keywords

• base
• nonn
• look

Comments

a(n) + n = A171901(k) for some k.

Links

• R. Zumkeller, Table of n, a(n) for n = 1..10000

Crossrefs

Cf. A196368, A171901, A171903.

Programs

Haskell

a171904 n = head [m | m <- a171901_list, a196368 (m + n) == 0]
-- Reinhard Zumkeller, Jan 31 2014

Formula

A196368(a(n)) + A196368(a(n)+n) = 0. - Reinhard Zumkeller, Jan 31 2014