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

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

%I #7 Mar 15 2014 10:40:05

%S 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,

%T 30,31,30,29,28,27,36,37,36,39,40,39,38,37,36,35,34,33,32,31,30,29,28,

%U 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

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

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

%H R. Zumkeller, <a href="/A167877/b167877.txt">Table of n, a(n) for n = 0..10000</a>

%o (Haskell)

%o a167877 n = head [x | let ts = a030341_row n, x <- [n, n-1 ..],

%o all (< 3) $ zipWith (+) ts (a030341_row x)]

%o -- _Reinhard Zumkeller_, Mar 15 2014

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

%Y Cf. A030341.

%K base,nonn,look

%O 0,4

%A _Reinhard Zumkeller_, Nov 14 2009