Function burnside_corner_orbits 

pub fn burnside_corner_orbits(n: usize, generators: &[CubeSym]) -> u64

Combinatorics — Burnside’s lemma. The number of corner orbits equals the average number of corners fixed by a group element: (1/|G|) Σ_g |Fix(g)|. A different invariant for the same count the orbit-BFS computes — counting by fixed points instead of by walking orbits. (n ≤ ~16.)