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