Let PG(n) be the graph with one node for each free n-celled polyomino and edges between nodes corresponding to polyominoes that can be obtained from each other by moving one cell, where the intermediate (the set of cells remaining when the cell to be moved is detached) is required to be a (connected) polyomino. a(n) is the number of edges in PG(n).
A367435
Let PG(n) be the graph with one node for each free n-celled polyomino and edges between nodes corresponding to polyominoes that can be obtained from each other by moving one cell, where the intermediate (the set of cells remaining when the cell to be moved is detached) is required to be a (connected) polyomino. a(n) is the number of edges in PG(n).
Terms
- a(0) =0a(1) =0a(2) =1a(3) =8a(4) =45a(5) =254a(6) =1258a(7) =6181a(8) =28062a(9) =125714a(10) =550402a(11) =2394654a(12) =10326665a(13) =44365096a(14) =189802060
External references
- oeis: A367435