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 A277813 #10 Nov 05 2016 07:22:39 %S A277813 1,2,1,3,2,1,4,5,3,2,6,1,7,8,4,9,5,3,10,2,11,12,6,1,13,14,7,15,8,4,16, %T A277813 17,9,5,18,3,19,20,10,2,21,22,11,23,12,6,24,1,25,26,13,27,14,7,28,29, %U A277813 15,8,30,4,31,32,16,33,17,9,34,5,35,36,18,3,37,38,19,39,20,10,40,2,41,42,21,43,22,11,44,45,23,12,46,6,47,48,24,1,49,50 %N A277813 a(n) = A115384(A277812(n)) = index of the row where n is located in array A277880. %C A277813 a(n) = index of the first odious number which is encountered when we start from k = n and iterate the map k -> A003188(A006068(k)/2). %C A277813 Ordinal transform of A277822. %C A277813 This works as a left inverse of A000069 like also does A115384. %H A277813 Antti Karttunen, <a href="/A277813/b277813.txt">Table of n, a(n) for n = 1..16384</a> %H A277813 <a href="/index/Bi#binary">Index entries for sequences related to binary expansion of n</a> %F A277813 a(n) = A115384(A277812(n)). %F A277813 Other identities. For all n >= 1: %F A277813 a(A000069(n)) = n. %F A277813 a(n) = a(floor(n/2)) when A010060(n) = 0. %o A277813 (Scheme) (define (A277813 n) (A115384 (A277812 n))) %Y A277813 Cf. A000069, A001969, A003188, A006068, A010060, A115384, A268671, A277812, A277880, A277822. %Y A277813 Cf. A003945 (the positions of 1's in this sequence). %K A277813 nonn,base %O A277813 1,2 %A A277813 _Antti Karttunen_, Nov 03 2016