This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A056017 #8 May 01 2014 02:47:40 %S A056017 0,1,2,3,4,5,7,6,8,11,9,10,12,13,18,14,15,19,16,20,17,21,29,22,23,30, %T A056017 24,31,25,26,32,27,28,33,34,47,35,36,48,37,49,38,39,50,40,41,51,42,52, %U A056017 43,44,53,45,54,46,55,76,56,57,77,58,78,59,60,79,61,62,80,63,81,64,65 %N A056017 Permutation of nonnegative integers formed by ranking fibbinary numbers (A003714) as if they were representatives of the circular binary sequences with forbidden -11- subsequence. %C A056017 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). %C A056017 In this permutation the Fibonacci numbers themselves (A000045) are fixed. %H A056017 <a href="/index/Per#IntegerPermutation">Index entries for sequences that are permutations of the natural numbers</a> %F A056017 [seq(CycBinSeqNo11Rank(fibbinary(j)), j=0..233)]; %F A056017 a[0] = 0, a[n] = CircBinSeqNo11Rank(fibbinary(n)) for n >= 1. %e A056017 0; 01,10; 100; 0101,1000,1010; 01001,10000,10010,10100; 010001,010101,100000,100010,100100,101000,101010; etc. %p A056017 CircBinSeqNo11Rank := n -> fibonacci(floor_log_2(n)+1-((-1)^n)) + interpret_as_zeckendorf_expansion(floor(n/(3-((-1)^n)))); %Y A056017 Inverse permutation: A056018. For fibbinary function see A048679, interpret_as_zeckendorf_expansion given in A048680. %K A056017 nonn %O A056017 0,3 %A A056017 _Antti Karttunen_, Jun 08 2000