|
%I #10 May 23 2015 06:44:09
%S 0,0,0,1,0,2,2,3,0,4,4,6,4,6,6,7,0,8,8,12,8,10,12,14,8,12,10,14,12,14,
%T 14,15,0,16,16,24,16,20,24,28,16,20,20,26,24,26,28,30,16,24,20,28,20,
%U 26,26,30,24,28,26,30,28,30,30,31,0,32,32,48,32,40,48,56,32,36,40,50,48,52,56,60,32,40,36,52,40,42,50,58,48,50,52,54,56,58,60
%N a(n)=0 for n <= 1; for n >= 2, a(n) = largest number that can be obtained by rotating non-msb bits of binary expansion of n (with A080541 or A080542), without the most significant bit of n: a(n) = A053645(A256999(n)).
%C For each n, apart from powers of 2, a(n) gives the lexicographically largest representative from the equivalence class of binary necklaces obtained by successively rotating (with A080541 or A080542) all the other bits than the most significant bit in the binary representation of n.
%H Antti Karttunen, <a href="/A257697/b257697.txt">Table of n, a(n) for n = 0..8192</a>
%F a(n) = A053645(A256999(n)).
%F Other identities and observations:
%F For all n >= 0, a(n) >= A053645(n).
%F Apart from powers of 2 (A000079), for any other n, a(n) >= A072376(n).
%o (Scheme) (define (A257697 n) (A053645 (A256999 n)))
%Y Cf. A000079, A053645, A072376, A080541, A080542, A256999.
%K nonn,base
%O 0,6
%A _Antti Karttunen_, May 16 2015
|
