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 A218550 #17 Jun 03 2025 10:34:01 %S A218550 0,1,2,3,4,5,6,7,8,10,13,19,15,16,27,39,51,67 %N A218550 a(n) = A213725(A218548(n)). %C A218550 a(n) tells the maximum depth + 1 of the n-th record size finite side-tree in the infinite beanstalk. %e A218550 a(7)=6 as the finite tree of 7 leaves (233, 234, 235, 238, 245, 250 and 251) and 6 internal vertices (244, 239, 232, 229, 228 and 224) rooted at 224 has the maximum depth of 5 (the path 224 -> 228 -> 232 -> 239 -> 244 -> 250/251). %o A218550 (Scheme) (define (A218550 n) (A213725 (A218548 n))) %Y A218550 Cf. A218549. %K A218550 nonn,base %O A218550 1,3 %A A218550 _Antti Karttunen_, Nov 04 2012