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,4

Comments

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

Links

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

Prog

(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

Crossrefs

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

Cf. A030341.

Sequence in context: A351113 A201935 A225445 * A308430 A280136 A258451

Adjacent sequences: A167874 A167875 A167876 * A167878 A167879 A167880

Keyword

base,nonn,look

Author

Reinhard Zumkeller, Nov 14 2009

Status

approved