This study explores the enumeration of polyominoes using a novel approach called nested chain abacus, defined as a graphical representation of connected partitions. The authors redefine polyominoes as a unique type of e-abacus diagram and present a new method for enumerating them, specifically focusing on the case where e equals 2. Despite the historical significance of polyomino enumeration, the paper highlights that the general enumeration problem remains unsolved.