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

0, 1, 0, 3, 4, 3, 2, 1, 0, 9, 10, 9, 12, 13, 12, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 0, 27, 28, 27, 30, 31, 30, 29, 28, 27, 36, 37, 36, 39, 40, 39, 38, 37, 36, 35, 34, 33, 32, 31, 30, 29, 28, 27, 26, 25, 24, 23, 22, 21, 20, 19, 18, 17, 16, 15, 14, 13, 12, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2

Offset: 0

Author

Reinhard Zumkeller, Nov 14 2009

Keywords

• base
• nonn
• look

Comments

A167878(n) = a(n) + n.

Links

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

Crossrefs

Cf. A007089, A167831, A035327 for the decimal and binary cases.

Cf. A030341.

Programs

Haskell

a167877 n = head [x | let ts = a030341_row n, x <- [n, n-1 ..],
                      all (< 3) $ zipWith (+) ts (a030341_row x)]
-- Reinhard Zumkeller, Mar 15 2014