Lemmas aside, how is this different than only checking repeated prime cycles in conjunction with one of the existing partition algorithms like NAUTY? Laci personally rejected my note submitted to Information Processing Letters saying the lower bound formula was &quot;trivial&quot;, <a href="https:&#x2F;&#x2F;oeis.org&#x2F;A186202" rel="nofollow">https:&#x2F;&#x2F;oeis.org&#x2F;A186202</a>