{'fraction_non_alphanumeric': 0.02056555269922879, 'fraction_numerical': 0.0, 'mean_word_length': 5.0, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
A Remarkable Combinatorial Identity

Summary We state and prove a combinatorial identity. Given an integer m, one forms all ordered partitions (or compositions) of m, then forms the product of the entries in each ordered partition. The identity combines the inverses of these products. We prove the identity by analytic methods and relate it to other identities with similar constructions.