A389964 a(n) is the number of edges in the graph PG(n) with one node for each free n-celled polyiamond and edges between nodes corresponding to polyiamonds 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 polyiamond.

0, 0, 0, 3, 5, 41, 137, 578, 1873, 6648, 21467, 70900, 227338, 733198, 2337411, 7456481, 23661005

Offset

1,4

Links

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

Crossrefs

Cf. A000577, A389965, A389966, A389961, A367435.

Sequence in context: A096058 A120265 A158328 * A389961 A258933 A060433

Adjacent sequences: A389961 A389962 A389963 * A389965 A389966 A389967

Keyword

nonn,more

Author

John Mason, Oct 21 2025

Status

approved