|
Search: id:A105529
|
|
|
| A105529 |
|
Given a list of ternary numbers, interpret each as a ternary Gray code number, then convert to decimal. |
|
+0
3
|
|
| 0, 1, 2, 4, 5, 3, 8, 6, 7, 13, 14, 12, 17, 15, 16, 9, 10, 11, 26, 24, 25, 18, 19, 20, 22, 23, 21
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
COMMENT
|
Ternary numbers are converted into ternary Gray code by using the following algorithm: Leftmost term is leftmost Gray code term. Then going to the right, if next term b is greater than current term a, then (b - a) is the next Gray code term. (Gray code terms do not enter into the algorithmic operation). If next term b < a, then add 3 to b and perform [(3+b) - a] which becomes the next Gray code term. If b = a, the Gray code term = 0.
Interpreting any N-Ary code for n as N-Ary Gray code or visa versa results in a permutation of the natural numbers. Any N-Ary term can be converted to the N-Ary Gray code by using a generalization of the algorithmic rules such that if b < a, then add N to b and perform [(N + b) - a]. The other rules remain the same. A105530: ternary Gray code interpreted as ternary.
|
|
EXAMPLE
|
a(9) = 13 since Ternary 100 (9 decimal) interpreted as Ternary Gray code = 13.
|
|
CROSSREFS
|
Cf. A105530, A003188.
Sequence in context: A026257 A099520 A071770 this_sequence A120237 A026182 A026198
Adjacent sequences: A105526 A105527 A105528 this_sequence A105530 A105531 A105532
|
|
KEYWORD
|
nonn,easy,more
|
|
AUTHOR
|
Gary W. Adamson (qntmpkt(AT)yahoo.com), Apr 11 2005
|
|
|
Search completed in 0.002 seconds
|
