Nowhere-zero Z5-flows on wheels

A wheel is a graph consisting from a vertex w and a cycle C such that each vertex of C is a neighbor of w. Two nowhere-zero Z5-flows on a wheel are equivalent if their values differ only on the edges of C. In this paper we give recursive formulas for the numbers of classes of the same cardinality of this equivalence.