|
%I #17 Oct 30 2019 02:17:44
%S 2,6,28,200,
%T 20703429013870789486355067368368128119278986281765151080710695359984173056
%N The asymptotic growth constant for the n-th two-dimensional Sierpinski graph can be written as log(c_n)/d_n; sequence gives c_n.
%C a(6) (shown) = 1386*2196^21, a(7) (too large to show) = 16814*37004^27.
%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. A324125.
%K nonn
%O 2,1
%A _N. J. A. Sloane_, Feb 16 2019
|
