|
|
A071334
|
|
Number of polyiamonds with n cells without holes that do not tile the plane.
|
|
4
|
|
|
0, 0, 0, 0, 0, 0, 1, 0, 20, 103, 594, 1192, 6290, 18099, 54808, 159048, 502366, 1374593, 4076218, 11378831, 32674779, 93006494, 264720498, 748062099, 2134512296, 6071524897, 17289205132, 49268564671, 140605019208, 401392287316
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,9
|
|
COMMENTS
|
There exist 112 polyiamonds without holes that have from 1 to 8 cells (A070765), but only one of these polyiamonds, corresponding to a(7)= 1 cannot tile the plane. This polyiamond is called V-shaped heptiamond (see proof in Martin Gardner's link in German).
____ ____
\ /\ /\ /
\/__\/__\/
\ /\ /
\/__\/
(End)
|
|
REFERENCES
|
M. Gardner, Tiling with Polyominoes, Polyiamonds and Polyhexes. Chap. 14 in Time Travel and Other Mathematical Bewilderments. New York: W. H. Freeman, pp. 175-187, 1988.
|
|
LINKS
|
Martin Gardner, V-heptiamond, Mathematisches Labyrinth: Neue Probleme für die Knobelgemeinde, p. 118, Google books.
|
|
MATHEMATICA
|
A[s_Integer] := With[{s6 = StringPadLeft[ToString[s], 6, "0"]}, Cases[ Import["https://oeis.org/A" <> s6 <> "/b" <> s6 <> ".txt", "Table"], {_, _}][[All, 2]]];
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,hard,more
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|