  Common meadows are commutative and associative algebraic structures with two
operations (addition and multiplication) with additive and multiplicative
identities and for which inverses are total. The inverse of zero is an error
term $\mathbf{a}$ which is absorbent for addition. We study the problem of
enumerating all finite common meadows of \emph{order} $n$ (that is, common
meadows with $n$ elements). This problem turns out to be deeply connected with
both the number of finite rings of order $n$ and with the number of a certain
kind of partition of positive integers.
