Number of equivalence classes of permutations of n letters, where the relation is that f and g are equivalent if every cycle of f is a power of some cycle of g.
A089179
Number of equivalence classes of permutations of n letters, where the relation is that f and g are equivalent if every cycle of f is a power of some cycle of g.
Terms
- a(0) =1a(1) =1a(2) =2a(3) =6a(4) =20a(5) =85a(6) =402a(7) =2464a(8) =15752a(9) =119655a(10) =976190a(11) =9331894a(12) =91769988a(13) =1077214879a(14) =12570658310a(15) =168390947820
External references
- oeis: A089179