A389970 Let PG(n) be the graph with one node for each free n-celled polyhex and edges between nodes corresponding to polyhexes 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 required to be a connected polyhex. a(n) is the number of edges in PG(n).

0, 0, 3, 17, 136, 979, 6335, 37839, 217559, 1224358, 6802217, 37534220

Offset

1,3

Links

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

Crossrefs

Cf. A000228, A389971, A389967, A367435 (polyominoes), A389964 (polyiamonds).

Sequence in context: A055214 A105630 A199138 * A006290 A060003 A350736

Adjacent sequences: A389967 A389968 A389969 * A389971 A389972 A389973

Keyword

nonn,more

Author

John Mason, Oct 29 2025

Status

approved