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 A071163 #14 Nov 27 2014 17:02:17 %S A071163 0,1,2,3,4,5,7,8,9,10,12,13,17,18,21,22,23,24,26,27,31,32,35,36,45,46, %T A071163 49,50,58,59,63,64,65,66,68,69,73,74,77,78,87,88,91,92,100,101,105, %U A071163 106,129,130,133,134,142,143,147,148,170,171,175,176,189,190,195,196,197 %N A071163 A014486-indices for rooted binary trees with height equal to number of internal vertices. (Binary trees where at each internal vertex at least the other child is leaf.) %C A071163 This subset of integers is closed by the actions of A069770, A057163, A069767, A069768, A122353, A122354, A122301, A122302, etc. (meaning, e.g., that A069767(a(n)) is a member from this sequence for all n), that is, by any Catalan bijection which is an image of some element of the automorphism group of infinite binary tree (the latter in a sense given by Grigorchuk, et al., being isomorphic to an infinitely iterated wreath product of cyclic groups of two elements). See the comments about the isomorphism "psi" given at A153141. %C A071163 a(n) could be probably computed directly from the binary expansion of n by using a (somewhat) similar ranking function as given in A209640, but utilizing A009766 instead of A007318. %H A071163 Antti Karttunen, <a href="/A071163/b071163.txt">Table of n, a(n) for n = 0..65535</a> %F A071163 a(n) = A080300(A071162(n)). %K A071163 nonn %O A071163 0,3 %A A071163 _Antti Karttunen_, May 14 2002