A324125 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.

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

Offset

2,1

Links

Table of n, a(n) for n=2..12.

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. A324126.

Sequence in context: A008332 A065390 A171835 * A376360 A212293 A360921

Adjacent sequences: A324122 A324123 A324124 * A324126 A324127 A324128

Keyword

nonn,more

Author

N. J. A. Sloane, Feb 16 2019

Status

approved