|
Search: id:A134028
|
|
|
| A134028 |
|
Reversal of n in balanced ternary representation. |
|
+0
4
|
|
| 0, 1, -2, 1, 4, -11, -2, 7, -8, 1, 10, -5, 4, 13, -38, -11, 16, -29, -2, 25, -20, 7, 34, -35, -8, 19, -26, 1, 28, -17, 10, 37, -32, -5, 22, -23, 4, 31, -14, 13, 40, -119, -38, 43, -92, -11, 70, -65, 16, 97, -110, -29, 52, -83, -2, 79, -56, 25, 106, -101, -20, 61, -74, 7, 88, -47, 34, 115, -116, -35, 46, -89, -8, 73, -62, 19, 100
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
COMMENT
|
a(A134027(n)) = A134027(n);
A134021(ABS(a(n))) <= A134021(n).
|
|
REFERENCES
|
D. E. Knuth, The Art of Computer Programming, Addison-Wesley, Reading, MA, Vol 2, pp 173-175.
|
|
LINKS
|
R. Zumkeller, Table of n, a(n) for n = 0..10000
Eric Weisstein's World of Mathematics, Reversal
Wikipedia, Balanced Ternary
|
|
EXAMPLE
|
20 = 1*3^3 - 1*3^2 + 1*3^1 - 1*3^0 == '+-+-'
=> a(20) = -1*3^3 + 1*3^2 - 1*3^1 + 1*3^0 = -20;
21 = 1*3^3 - 1*3^2 + 1*3^1 + 0*3^0 == '+-+0'
=> a(21) = 0*3^3 + 1*3^2 - 1*3^1 + 1*3^0 = 7;
22 = 1*3^3 - 1*3^2 + 1*3^1 + 1*3^0 == '+-++'
=> a(22) = 1*3^3 + 1*3^2 - 1*3^1 + 1*3^0 = 34;
23 = 1*3^3 + 0*3^2 - 1*3^1 - 1*3^0 == '+0--'
=> a(23) = -1*3^3 - 1*3^2 + 0*3^1 + 1*3^0 = -35;
24 = 1*3^3 + 0*3^2 - 1*3^1 + 0*3^0 == '+0-0'
=> a(24) = 0*3^3 - 1*3^2 + 0*3^1 + 1*3^0 = -8;
25 = 1*3^3 + 0*3^2 - 1*3^1 + 1*3^0 == '+0-+'
=> a(25) = 1*3^3 - 1*3^2 + 0*3^1 + 1*3^0 = 19.
|
|
CROSSREFS
|
Cf. A030102.
Sequence in context: A121198 A001071 A016544 this_sequence A088137 A064297 A052661
Adjacent sequences: A134025 A134026 A134027 this_sequence A134029 A134030 A134031
|
|
KEYWORD
|
sign
|
|
AUTHOR
|
Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Oct 19 2007
|
|
|
Search completed in 0.002 seconds
|
