Algorithms for numerical semigroups with fixed maximum primitive

Abstract

We present an algorithm to explore various properties of the numerical semigroups with a given maximum primitive. In particular, we count the number of such numerical semigroups and verify that there is no counterexample to Wilf's conjecture among the numerical semigroups with maximum primitive up to \(60\).