|
Search: id:A134323
|
|
|
| A134323 |
|
Value of lowest trit of prime(n) in balanced ternary representation. |
|
+0
5
|
|
| -1, 0, -1, 1, -1, 1, -1, 1, -1, -1, 1, 1, -1, 1, -1, -1, -1, 1, 1, -1, 1, 1, -1, -1, 1, -1, 1, -1, 1, -1, 1, -1, -1, 1, -1, 1, 1, 1, -1, -1, -1, 1, -1, 1, -1, 1, 1, 1, -1, 1, -1, -1, 1, -1, -1, -1, -1, 1, 1, -1, 1, -1, 1, -1, 1, -1, 1, 1, -1, 1, -1, -1, 1, 1, 1, -1, -1, 1, -1, 1, -1, 1, -1, 1, 1, -1, -1, 1, -1, 1, -1, -1, 1, -1, 1, -1, -1, -1, 1, 1, 1, -1
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
a(n) <> 0 for n <> 2; a(A049084(A003627(n))) = -1; a(A049084(A002476(n))) = +1.
Ignoring the first 2 terms, it appears that the entries correspond to the locations of the prime numbers when expressed in terms of 6N+/-1. Specifically, using -1 when the prime is just below 6N and +1 when it is just above. - Bill R McEachen (bmceache(AT)centralsan.dst.ca.us), Feb 24 2008
|
|
REFERENCES
|
D. E. Knuth, The Art of Computer Programming, Addison-Wesley, Reading, MA, Vol 2, pp 173-175.
|
|
LINKS
|
Wikipedia, Balanced Ternary
|
|
FORMULA
|
a(n) = (1 - 0^A039701(n)) * (-1)^(A039701(n)+1).
|
|
EXAMPLE
|
A000040(20) = 71 = 1*3^4+0*3^3-1*3^2+0*3^1-1*3^0, therefore
71 == '+0-0-' and a(20) = -1;
A000040(21) = 73 = 1*3^4+0*3^3-1*3^2+0*3^1+1*3^0, therefore
73 == '+0-0+' and a(21) = +1.
|
|
CROSSREFS
|
Adjacent sequences: A134320 A134321 A134322 this_sequence A134324 A134325 A134326
Sequence in context: A013596 A131695 A105812 this_sequence A060576 A019590 A014040
|
|
KEYWORD
|
sign,base
|
|
AUTHOR
|
Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Oct 21 2007
|
|
|
Search completed in 0.002 seconds
|
