Counting nowhere-zero flows on wheels

A wheel is a graph consisting from a vertex w and a circuit C such that each vertex of C is a neighbor of w. Two nowhere-zero group valued flows on a wheel are equivalent if their values differ only on the edges of C. We introduce recursive formulas for the numbers of classes of the same cardinality of this equivalence.