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).

0, 0, 1, 17, 144, 1624, 15836, 147048, 1300305, 11363024, 98232652

Offset

1,4

Links

Table of n, a(n) for n=1..11.

Crossrefs

Cf. A098891, A390206.

Sequence in context: A376459 A304207 A163038 * A216422 A008417 A241796

Adjacent sequences: A390202 A390203 A390204 * A390206 A390207 A390208

Keyword

nonn,more

Author

John Mason, Nov 03 2025

Status

approved