OFFSET
1,2
COMMENTS
Analogous to a bit, a ternary digit is a trit (trinary digit).
Per the definition, n + a(n) = 2*3^(s-1), where s is the number of trits of n and a(n), n and a(n) form a decomposition of 2*3^(s-1).
LINKS
Lei Zhou, Table of n, a(n) for n = 1..10000
FORMULA
a(n) = 2*3^(floor(log_3(2*n-1))) - n. [corrected by Jason Yuen, Nov 18 2024]
EXAMPLE
For n=1 the balanced ternary form of 1 is 1, which has 1 trits. 2*3^(1-1)-1 = 1, so a(1) = 1.
For n=2 the balanced ternary form of 2 is 1T, which has 2 trits. 2*3^(2-1)-2 = 4, so a(2) = 4.
For n=3 the balanced ternary form of 3 is 10, which has 2 trits. 2*3^(2-1)-3 = 3, so a(2) = 3.
...
For n=62 the balanced ternary form of 62 is 1T10T, which has 5 trits. 2*3^(5-1)-62 = 100, so a(62) = 100.
MATHEMATICA
Table[2*3^(Floor[Log[3, 2*n - 1]]) - n, {n, 1, 62}]
PROG
(Python)
from sympy import integer_log
def a(n): return 2*3**(integer_log(2*n - 1, 3)[0]) - n
print([a(n) for n in range(1, 101)]) # Indranil Ghosh, Jun 10 2017
(PARI) a(n) = 2*3^logint(2*n-1, 3)-n \\ Jason Yuen, Nov 18 2024
CROSSREFS
KEYWORD
nonn,base,easy
AUTHOR
Lei Zhou, Nov 10 2016
STATUS
approved