|
Search: id:A092569
|
|
|
| A092569 |
|
Permutation of integers a(a(n)) = n. In binary representation of n, transformation of inner bits, 1 <-> 0, gives binary representation of a(n). |
|
+0
2
|
|
| 0, 1, 2, 3, 6, 7, 4, 5, 14, 15, 12, 13, 10, 11, 8, 9, 30, 31, 28, 29, 26, 27, 24, 25, 22, 23, 20, 21, 18, 19, 16, 17, 62, 63, 60, 61, 58, 59, 56, 57, 54, 55, 52, 53, 50, 51, 48, 49, 46, 47, 44, 45, 42, 43, 40, 41, 38, 39, 36, 37, 34, 35, 32, 33, 126, 127, 124, 125, 122, 123, 120
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
COMMENT
|
Primes which stay primes under transformation "opposite inner bits", A092570.
|
|
EXAMPLE
|
a(9)=15 because 9_10=1001_2, transformation of inner bits gives 1001_2 -> 1111_2 = 15_10.
|
|
MATHEMATICA
|
bb={0, 1, 2, 3}; Do[id=IntegerDigits[n, 2]; Do[id[[i]]=1-id[[i]], {i, 2, Length[id]-1}]; bb=Append[bb, FromDigits[id, 2]], {n, 4, 1000}]; fla=Flatten[bb]
|
|
CROSSREFS
|
Cf. A092570.
Sequence in context: A068587 A001058 A114462 this_sequence A088573 A126388 A039247
Adjacent sequences: A092566 A092567 A092568 this_sequence A092570 A092571 A092572
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Zak Seidov (zakseidov(AT)yahoo.com), Feb 28 2004
|
|
|
Search completed in 0.002 seconds
|
