 The basic idea is that we begin with a single square, and from there, recursively add squares.Depending on the details, it may count each "n"-omino "n" times, once from starting from each of its "n" squares, or may be arranged to count each once only.The simplest implementation involves adding one square at a time.