# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/

Search: id:a324125
Showing 1-1 of 1

%I A324125 #14 Oct 30 2019 02:18:06
%S A324125 3,7,12,18,550,924,42,52,3528,4950,88
%N 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.
%H A324125 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 A324125 Cf. A324126.
%K A324125 nonn,more
%O A324125 2,1
%A A324125 _N. J. A. Sloane_, Feb 16 2019

# Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE