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 A338294 #7 Aug 22 2021 13:25:47
%S A338294 1,5,3,7,1,7,6,7,1,7,1,8,2,3,5,7,9,4,9,5,9,0,1,4,0,3,2,8,9,5,5,2,2,1,
%T A338294 6,0,2,5,0,1,5,0,8,0,9,3,4,3,2,3,6,1,7,3,2,6,5,1,0,2,0,0,2,9,5,0,1,4,
%U A338294 0,0,8,8,2,7,0,8,8,8,1,1,2,4,3,5,3,2,9
%N A338294 Decimal expansion of the growth power of the number of matchings in the complete binary tree.
%C A338294 The number of matchings in the complete binary tree of n rows is A338293(n). It grows as A338293(n) ~ (1/2)*C^(2^n) where C is the present constant. See A338293 on how log(C) = A242049 follows from the number of matchings as a product of Jacobsthal numbers.
%H A338294 Kevin Ryde, <a href="http://user42.tuxfamily.org/pari-vpar/index.html">vpar</a> examples/complete-binary-matchings.gp calculations and code in PARI/GP.
%F A338294 Equals exp(A242049).
%F A338294 Equals lim_{n->oo} A338293(n)^(1/2^n).
%e A338294 1.537176717...
%Y A338294 Cf. A242049, A338293.
%K A338294 nonn,cons
%O A338294 1,2
%A A338294 _Kevin Ryde_, Oct 21 2020