login
A264982
Binary width of terms produced by match-making permutation: a(n) = A070939(A266195(n)).
4
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, 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, 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
OFFSET
1,2
COMMENTS
Each n occurs A000079(n-1) = 2^(n-1) times in total.
LINKS
FORMULA
a(n) = A070939(A266195(n)).
PROG
(Scheme) (define (A264982 n) (A070939 (A266195 n)))
CROSSREFS
Cf. A266186 (where n first appears, most likely also the positions of records).
Cf. A266187 (where n last appears).
Cf. A266197 (gives numbers n where a(n) = a(n+1)).
Sequence in context: A072789 A126302 A200648 * A134674 A253894 A000121
KEYWORD
nonn,base
AUTHOR
Antti Karttunen, Dec 26 2015
STATUS
approved