OFFSET
0,3
COMMENTS
This permutation is induced by the Basilica group generating wreath recursion a = (1,b), b = s(1,a) (i.e. binary transducer, where s means that the bits at that state are toggled: 0 <-> 1) given on the page 40 of Bartholdi and Virag paper, starting from the inactive (fixing) state a and rewriting bits from the second most significant bit to the least significant end.
REFERENCES
R. I. Grigorchuk and A. Zuk, Spectral properties of a torsion free weakly branch group defined by a three state automaton, Contemporary Mathematics 298 (2002), 57--82.
LINKS
A. Karttunen, Table of n, a(n) for n = 0..2047
L. Bartholdi and B. Virag, Amenability via random walks, arXiv:math/0305262 [math.GR], 2003.
L. Bartholdi and B. Virag, Amenability via random walks, Duke Math. J. Volume 130, Number 1 (2005), 39--56.
EXAMPLE
Starting from the second most significant bit, we continue complementing every second bit (in this case, not starting before at the thirdmost significant bit), as long as the first zero is encountered, which is also complemented if its distance to the most significant bit is even, after which the remaining bits are left intact. E.g. 121 = 1111001 in binary. Complementing its thirdmost significant bit and the first zero-bit two positions right of it (i.e. bit-2, 4 steps to the most significant bit, bit-6), we obtain "11011.." after which the rest of the bits stay same, so we get 1101101, which is 109's binary representation, thus a(121)=109. On the other hand, 125 = 1111101 in binary and the transducer complements the bits at positions 4 and 2, yielding 11010.. and then switches to the fixing state at the zero encounted at bit-position 1, without complementing it (as it is 5 steps from the msb) and the rest are fixed, so we get 1101001, which is 105's binary representation, thus a(125)=105.
PROG
CROSSREFS
KEYWORD
nonn,base
AUTHOR
Antti Karttunen, Jan 17 2009
EXTENSIONS
Spelling/notation corrections by Charles R Greathouse IV, Mar 18 2010
STATUS
approved