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 A218610 #16 Jul 25 2025 16:47:07 %S A218610 0,1,3,4,2,37,110,18,11,32,33,4755,16127,73542063,97105360,62, %T A218610 1306632183,39288694215537689,193,8150,719,12,5,13505, %U A218610 246941338376004599,13,45,407,944077158106260984,4975012595,5738426278308884,26,27439590092251146768825651348524279 %N A218610 Distinct values of A218788 in the order of appearance. %C A218610 a(n) = A014486-index for the n-th tendril of the infinite beanstalk (A179016), which has not been encountered before, constructed with lesser numbers coming to the right, and larger to the left hand side of each branch. %H A218610 A. Karttunen, <a href="/A218610/b218610.txt">Table of n, a(n) for n = 1..72</a> %H A218610 A. Karttunen, <a href="/A014486/a014486_1.pdf">Illustration of how binary trees (the second rightmost column) are encoded by A014486</a> %F A218610 a(n) = A218788(A218611(n)). %o A218610 (Scheme) (define (A218610 n) (A218788 (A218611 n))) %Y A218610 These are the mirror-images of binary trees given in A218609, i.e. a(n) = A057163(A218609(n)). A218613 gives the sizes of these trees. Cf. A218611. %K A218610 nonn %O A218610 1,3 %A A218610 _Antti Karttunen_, Nov 11 2012