OFFSET
1,3
COMMENTS
A free tree-like polycube of size n in three dimensions is a face-connected set of n cells in the cubic lattice, up to translation, rotation and reflection, whose dual graph has no cycles.
LINKS
Alexandre Blondin Massé, Julien de Carufel, Alain Goupil, and Maxime Samson, Fully-leafed tree-like polyominoes and polycubes, In Combinatorial algorithms, volume 10765 of Lecture Notes of Computer Science, 28th International workshop, IWOCA 2017, Newcastle, NSW, Australia, Springer, 2018.
CROSSREFS
KEYWORD
nonn,hard,more
AUTHOR
Lotfi Bouallagui, May 07 2018
EXTENSIONS
Terms a(13) and a(14) from Joerg Arndt and Márk Péter Légrádi, May 21 2023
STATUS
approved