A338294 Decimal expansion of the growth power of the number of matchings in the complete binary tree.

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, 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, 0, 0, 8, 8, 2, 7, 0, 8, 8, 8, 1, 1, 2, 4, 3, 5, 3, 2, 9

Offset

1,2

Comments

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.

Links

Table of n, a(n) for n=1..87.

Kevin Ryde, vpar examples/complete-binary-matchings.gp calculations and code in PARI/GP.

Formula

Equals exp(A242049).

Equals lim_{n->oo} A338293(n)^(1/2^n).

Example

1.537176717...

Crossrefs

Cf. A242049, A338293.

Sequence in context: A371847 A097907 A198749 * A066253 A065169 A247617

Adjacent sequences: A338291 A338292 A338293 * A338295 A338296 A338297

Keyword

nonn,cons

Author

Kevin Ryde, Oct 21 2020

Status

approved