

A121197


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.


2



2, 2, 8, 34, 158, 777, 4006, 21224, 114348, 624222, 3441050, 19121530, 106957272
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,1


COMMENTS

The Zucca web site calls these figures "nDifferentSquares".


REFERENCES

Branko Grünbaum and G. C. Shephard, Tilings and Patterns. W. H. Freeman, New York, 1987.


LINKS

Table of n, a(n) for n=1..13.
Livio Zucca, PolyMultiForms


CROSSREFS

Cf. A121195, A121196, A121198.
Sequence in context: A076143 A226585 A057132 * A219348 A009543 A102647
Adjacent sequences: A121194 A121195 A121196 * A121198 A121199 A121200


KEYWORD

nonn,nice,hard,more


AUTHOR

N. J. A. Sloane, Aug 17 2006


EXTENSIONS

More terms from Don Reble, Aug 17 2007
a(13) from Joseph Myers, Oct 06 2011


STATUS

approved



