Let PG(n) be the graph with one node for each free n-celled polycube, and edges between nodes corresponding to polycubes that can be obtained from each other by moving one cell, where the intermediate polyform (the set of cells remaining when the cell to be moved is detached) is not required to be a connected polycube. a(n) is the number of edges in PG(n).
A390205
Let PG(n) be the graph with one node for each free n-celled polycube, and edges between nodes corresponding to polycubes that can be obtained from each other by moving one cell, where the intermediate polyform (the set of cells remaining when the cell to be moved is detached) is not required to be a connected polycube. a(n) is the number of edges in PG(n).
Terms
- a(0) =0a(1) =0a(2) =1a(3) =17a(4) =144a(5) =1624a(6) =15836a(7) =147048a(8) =1300305a(9) =11363024a(10) =98232652
External references
- oeis: A390205