OFFSET
0,3
COMMENTS
Function CircBinSeqNo11Rank gives the position of any 11-free binary sequence in this sequence, where each block consists of Lucas(n-2) sequences of length n: (either the leftmost or the rightmost digit is 1, but not both).
In this permutation the Fibonacci numbers themselves (A000045) are fixed.
LINKS
FORMULA
[seq(CycBinSeqNo11Rank(fibbinary(j)), j=0..233)];
a[0] = 0, a[n] = CircBinSeqNo11Rank(fibbinary(n)) for n >= 1.
EXAMPLE
0; 01,10; 100; 0101,1000,1010; 01001,10000,10010,10100; 010001,010101,100000,100010,100100,101000,101010; etc.
MAPLE
CircBinSeqNo11Rank := n -> fibonacci(floor_log_2(n)+1-((-1)^n)) + interpret_as_zeckendorf_expansion(floor(n/(3-((-1)^n))));
CROSSREFS
KEYWORD
nonn
AUTHOR
Antti Karttunen, Jun 08 2000
STATUS
approved