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 A256999 #11 May 22 2015 14:55:48 %S A256999 0,1,2,3,4,6,6,7,8,12,12,14,12,14,14,15,16,24,24,28,24,26,28,30,24,28, %T A256999 26,30,28,30,30,31,32,48,48,56,48,52,56,60,48,52,52,58,56,58,60,62,48, %U A256999 56,52,60,52,58,58,62,56,60,58,62,60,62,62,63,64,96,96,112,96,104,112,120,96,100,104,114,112,116,120,124,96,104,100 %N A256999 a(n)=n 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). %H A256999 Antti Karttunen, <a href="/A256999/b256999.txt">Table of n, a(n) for n = 0..8192</a> %o A256999 (Scheme, two variants) %o A256999 (define (A256999 n) (let loop ((k (A080541 n)) (m n)) (cond ((= k n) m) (else (loop (A080541 k) (max m k)))))) %o A256999 (define (A256999 n) (let loop ((k (A080542 n)) (m n)) (cond ((= k n) m) (else (loop (A080542 k) (max m k)))))) %Y A256999 Cf. A080541, A080542, A073138, A246593, A257697. %Y A256999 Cf. A257250 (fixed points of this sequence). %Y A256999 Cf. also A163380 (analogous sequence when rotating all bits of binary representation). %K A256999 nonn,base %O A256999 0,3 %A A256999 _Antti Karttunen_, May 16 2015