login
A324126
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.
1
2, 6, 28, 200, 20703429013870789486355067368368128119278986281765151080710695359984173056
OFFSET
2,1
COMMENTS
a(6) (shown) = 1386*2196^21, a(7) (too large to show) = 16814*37004^27.
LINKS
Elmar Teufl and Stephan Wagner, Exact and asymptotic enumeration of perfect matchings in self-similar graphs, Discrete Mathematics 309(23-24) (2009), 6612-6625; see Table 1 (p. 6619).
CROSSREFS
Cf. A324125.
Sequence in context: A201959 A216187 A178446 * A272662 A125812 A093657
KEYWORD
nonn
AUTHOR
N. J. A. Sloane, Feb 16 2019
STATUS
approved