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 A292264 #8 Sep 30 2017 16:06:57 %S A292264 0,1,2,2,4,4,4,5,8,8,8,9,8,8,10,11,16,16,16,17,16,16,18,19,16,16,16, %T A292264 17,20,20,22,23,32,32,32,33,32,32,34,35,32,32,32,33,36,36,38,39,32,32, %U A292264 32,33,32,32,34,35,40,40,40,41,44,44,46,47,64,64,64,65,64,64,66,67,64,64,64,65,68,68,70,71,64,64,64,65,64,64,66,67,72,72,72,73,76,76 %N A292264 a(n) = n - A292944(n). %C A292264 Because A292263(n) = a(A243071(n)), the sequence works as a "masking function" where the 1-bits in a(n) (always a subset of the 1-bits in binary expansion of n) indicate which numbers are of the form 6k+1 or 6k+5 in binary tree A163511 (or in its mirror image tree A005940) on that trajectory which leads from the root of the tree to the node containing A163511(n). %H A292264 Antti Karttunen, <a href="/A292264/b292264.txt">Table of n, a(n) for n = 0..16383</a> %H A292264 <a href="/index/Bi#binary">Index entries for sequences related to binary expansion of n</a> %F A292264 a(n) = n - A292944(n). %F A292264 a(n) = A292263(A163511(n)). %F A292264 a(n) = A292942(n) + A292946(n). %F A292264 a(n) = A292254(n) + A292256(n). %o A292264 (Scheme) (define (A292264 n) (A292263 (A163511 n))) %Y A292264 Cf. A005940, A163511, A292263. %Y A292264 Cf. A048735, A292944, A292272 but also A292254, A292256, A292942, A292946 for similarly constructed sequences. %K A292264 nonn,base %O A292264 0,3 %A A292264 _Antti Karttunen_, Sep 30 2017