Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #15 Jul 29 2013 05:00:08
%S 0,1,4,2,7,12,6,3,11,19,33,20,10,17,9,5,18,30,51,31,54,88,53,32,16,27,
%T 46,28,15,25,14,8,29,48,80,49,83,135,82,50,87,142,232,143,86,140,85,
%U 52,26,43,72,44,75,122,74,45,24,40,67,41,23,38,22,13,47,77
%N Permutation of nonnegative integers: map each number by lengths of runs in its binary representation to the number in whose once left-shifted Zeckendorf representation occurs the same run lengths (in the same order) as the lengths of consecutive blocks of zeros.
%C See the comments at the inverse permutation A227351 where the idea behind this mapping is explained.
%H Antti Karttunen, <a href="/A227352/b227352.txt">Table of n, a(n) for n = 0..8192</a>
%H <a href="/index/Per#IntegerPermutation">Index entries for sequences that are permutations of the natural numbers</a>
%F a(n) = A048680(A003188(n)). [The defining formula]
%F Moreover, this permutation effects the following correspondences:
%F For n>=1 A000523(n) = A102364(a(n)).
%F For all n, A167489(n) = A227355(a(2n+1)).
%o (Scheme) (define (A227352 n) (A048680 (A003188 n)))
%Y Inverse permutation: A227351. Cf. A048680, A003188.
%K nonn,base
%O 0,3
%A _Antti Karttunen_, Jul 08 2013