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 A084107 #8 Jul 26 2022 02:51:48 %S A084107 0,2,50,14642,1016674610,4489135110542145842, %T A084107 83940259113354708787282267381662562610, %U A084107 28755706180189132304920279902696353117047700481289459579932708798287463397682 %N A084107 A014486-encoding of "Complete Binary Trees". %C A084107 "Complete" or "full binary tree" refers to a unique binary tree of (2^n)-1 nodes with its 2^(n-1) leaves all on the same height (or depth) n-1 (when the root is at height 0). These are depicted at A073346. This differs from "completely binary tree", with which some authors refer to trees more akin to the trees encoded by A080299. %H A084107 <a href="/index/Ro#RootedTreePlanEncodings">Index entries for encodings of plane rooted trees</a> %Y A084107 a(n) = A014486(A084108(n)). Subset of A083941. %K A084107 nonn %O A084107 0,2 %A A084107 _Antti Karttunen_, May 13 2003