This recursive version of the Murnaghan-Nakayama rule is especially efficient for computer calculation when one computes character tables for S k for increasing values of k and stores all of the previously computed character tables.