%I #15 Oct 19 2017 03:15:03
%S 2,2,8,34,158,777,4006,21224,114348,624222,3441050,19121530,106957272
%N Consider the tiling of the plane with squares of two different sizes as in Fig. 2.4.2(g) of Grünbaum and Shephard, p. 74. a(n) is the number of connected figures that can be formed on this tiling, from any n squares.
%C The Zucca web site calls these figures "n-DifferentSquares".
%D Branko Grünbaum and G. C. Shephard, Tilings and Patterns. W. H. Freeman, New York, 1987.
%H Livio Zucca, <a href="http://www.iread.it/lz/polymultiforms2.html">PolyMultiForms</a>
%Y Cf. A121195, A121196, A121198.
%K nonn,nice,hard,more
%O 1,1
%A _N. J. A. Sloane_, Aug 17 2006
%E More terms from _Don Reble_, Aug 17 2007
%E a(13) from _Joseph Myers_, Oct 06 2011