|
| |
|
|
A098891
|
|
Define the n-mino graph to be the graph whose vertices are each of the n-minoes, two of which are joined by an edge if one can be obtained from the other by cutting out one of the latter's component squares (thus obtaining an (n-1)-mino) and glueing it elsewhere. The sequence counts the edges in these graphs.
|
|
0
| | |
| |
| |
|
|
