login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A167877 Largest m<=n such that no carry occurs when adding m to n in ternary arithmetic. 4
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 (list; graph; refs; listen; history; text; internal format)
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: A279590 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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 24 18:52 EDT 2019. Contains 326295 sequences. (Running on oeis4.)