|
Search: id:A057337
|
|
|
| A057337 |
|
1) Write the Zeckendorf expression of n; 2) Remove initial 1 and append a final 0; 3) Replace numbers in this as follows: 0 -> 1, 010 -> 2, 01010 -> 3, 0101010 -> 4...; 4) Find a binary number with run lengths from step 3 (starting with 1); 5) The term a(n) is the decimal equivalent of this binary number. |
|
+0
2
|
|
| 1, 2, 5, 3, 10, 4, 6, 21, 11, 9, 13, 7, 42, 20, 22, 18, 8, 26, 12, 14, 85, 43, 41, 45, 23, 37, 19, 17, 53, 27, 25, 29, 15, 170, 84, 86, 82, 40, 90, 44, 46, 74, 36, 38, 34, 16, 106, 52, 54, 50, 24, 58, 28, 30, 341, 171, 169, 173, 87, 165, 83, 81, 181, 91, 89, 93, 47, 149, 75
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
A permutation of the positive integers
|
|
EXAMPLE
|
a(18) = 26 because: 1) the Zeckendorf expression for 18 is 101000 (13 + 5) 2) this becomes 010000 3) 010 -> 2, 0 -> 1, 0 -> 1, 0 -> 1 4) 2 ones, 1 zero, 1 one, 1 zero: 11010 5) the binary number 11010 in decimal is 26
|
|
CROSSREFS
|
Inverse of A057336.
Sequence in context: A119435 A044043 A133128 this_sequence A163233 A096666 A064664
Adjacent sequences: A057334 A057335 A057336 this_sequence A057338 A057339 A057340
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Alex Fink (fink(AT)cadvision.com), Aug 27 2000
|
|
EXTENSIONS
|
More terms from David W. Wilson (davidwwilson(AT)comcast.net), May 12 2001
|
|
|
Search completed in 0.002 seconds
|
