A390202 Let PG(n) be the graph with one node for each free n-celled polyomino in the {4,5} tessellation of the hyperbolic plane, and edges between nodes corresponding to polyominoes 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 polyomino. a(n) is the number of edges in PG(n).

0, 0, 1, 8, 71, 531, 3478, 21296, 126546, 739683, 4302857

Offset

1,4

Comments

This sequence was calculated in the context of a project in collaboration with Érika Roldán, and Rosemberg Toalá-Enríquez.

Links

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

John Mason, Graph of {4,5} tetrominoes

Crossrefs

Cf. A098891, A119611, A390203.

Sequence in context: A217328 A193102 A390203 * A038145 A198856 A320092

Adjacent sequences: A390199 A390200 A390201 * A390203 A390204 A390205

Keyword

nonn,more

Author

John Mason, Nov 03 2025

Status

approved