login
The asymptotic growth constant for the n-th two-dimensional Sierpinski graph can be written as log(c_n)/d_n; sequence gives d_n.
1

%I #14 Oct 30 2019 02:18:06

%S 3,7,12,18,550,924,42,52,3528,4950,88

%N The asymptotic growth constant for the n-th two-dimensional Sierpinski graph can be written as log(c_n)/d_n; sequence gives d_n.

%H Elmar Teufl and Stephan Wagner, <a href="https://doi.org/10.1016/j.disc.2009.07.009">Exact and asymptotic enumeration of perfect matchings in self-similar graphs</a>, Discrete Mathematics 309(23-24) (2009), 6612-6625; see Table 1 (p. 6619).

%Y Cf. A324126.

%K nonn,more

%O 2,1

%A _N. J. A. Sloane_, Feb 16 2019