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 #9 Dec 28 2015 15:42:38
%S 1,2,2,3,3,3,4,3,4,4,4,5,4,5,4,6,4,5,5,5,6,4,6,5,7,5,5,6,5,7,5,7,5,6,
%T 6,7,6,6,6,7,5,8,5,8,5,8,5,8,5,9,6,7,6,7,6,8,6,7,7,8,7,7,7,8,7,8,8,8,
%U 6,8,7,8,7,9,6,9,6,9,6,9,6,10,6,9,6,9,6,10,6,10,6,9,7,8,7,9,7,10,6,10,6,10,6,11,6,11,6,11,6,11,6,11,6,11,6,12,7
%N Binary width of terms produced by match-making permutation: a(n) = A070939(A266195(n)).
%C Each n occurs A000079(n-1) = 2^(n-1) times in total.
%H Antti Karttunen, <a href="/A264982/b264982.txt">Table of n, a(n) for n = 1..2694</a>
%F a(n) = A070939(A266195(n)).
%o (Scheme) (define (A264982 n) (A070939 (A266195 n)))
%Y Cf. A000079, A070939, A266195.
%Y Cf. A266186 (where n first appears, most likely also the positions of records).
%Y Cf. A266187 (where n last appears).
%Y Cf. A266197 (gives numbers n where a(n) = a(n+1)).
%K nonn,base
%O 1,2
%A _Antti Karttunen_, Dec 26 2015