|
|
A252754
|
|
Inverse of "Tree of Eratosthenes" permutation: a(1) = 0, after which, a(2n) = 1 + 2*a(n), a(2n+1) = 2 * a(A268674(2n+1)).
|
|
19
|
|
|
0, 1, 2, 3, 4, 5, 8, 7, 6, 9, 16, 11, 32, 17, 10, 15, 64, 13, 128, 19, 14, 33, 256, 23, 12, 65, 18, 35, 512, 21, 1024, 31, 22, 129, 20, 27, 2048, 257, 34, 39, 4096, 29, 8192, 67, 30, 513, 16384, 47, 24, 25, 26, 131, 32768, 37, 28, 71, 38, 1025, 65536, 43, 131072, 2049, 66, 63, 36, 45, 262144, 259, 46, 41, 524288, 55, 1048576, 4097, 130, 515, 40
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,3
|
|
LINKS
|
|
|
FORMULA
|
a(1) = 0, after which, a(2n) = 1 + 2*a(n), a(2n+1) = 2 * a(A268674(2n+1)).
As a composition of related permutations:
(End)
|
|
PROG
|
(Scheme, with memoization-macro definec)
|
|
CROSSREFS
|
Differs from A156552 for the first time at n=21, where a(21) = 14, while A156552(21) = 18.
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|