|
|
A268758
|
|
Number of polyominoes with width and height equal to 2n that are invariant under all symmetries of the square.
|
|
3
|
|
|
1, 3, 17, 163, 2753, 84731, 4879497, 535376723, 112921823249, 45931435159067, 36048888105745113, 54568015172025197171, 159197415409641803530753, 894444473815989281612355579, 9671160618112663336510127727593, 201110001346886305066013828873025811
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
Also number of polyominoes with width and height equal to 2n - 1 that are invariant under all symmetries of the square.
The water retention model for mathematical surfaces is described in the link below. The definition of a "lake" in this model is related to a class of polyominoes in A268339. Percolation theory may refer to these structures as "clusters that touch all boundaries."
Transportation across the square lattice requires a path of continuous edge connected cells. Is a pattern that only connects two opposite boundaries of the square ranked differently from one that connects all four boundaries?
This sequence is part of a effort to classify water retention patterns in a square by their symmetry, their capacity to connect boundaries of the square and the number of edge cells that are connected across opposite boundaries.
|
|
LINKS
|
|
|
FORMULA
|
|
|
EXAMPLE
|
For a(2) = 3: the three polyominoes of width and height 2*2 - 1 = 3 and the corresponding three polynomial of width and height 2*2 = 4 are shown below. Note that each even-dimension polyomino is produced by duplicating the center row/column of an odd-dimension polyomino.
3 X 3:
0 1 0 1 1 1 1 1 1
1 1 1 1 0 1 1 1 1
0 1 0 1 1 1 1 1 1
4 X 4:
0 1 1 0 1 1 1 1 1 1 1 1
1 1 1 1 1 0 0 1 1 1 1 1
1 1 1 1 1 0 0 1 1 1 1 1
0 1 1 0 1 1 1 1 1 1 1 1
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|