We consider the special case of treelike polyhexes for which the conse
cutive removal of endhexagons results in a path, or complete disappear
ance. We derive a generating function for counting the isomorphism cla
sses of these ''polycats'' up to reflection and rotation.