{'fraction_non_alphanumeric': 0.059593023255813955, 'fraction_numerical': 0.03343023255813953, 'mean_word_length': 3.9214285714285713, '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}}
Generalising ‘Sums of cubes equal to squares of sums’

David Pagni drew attention to a result which is ascribed by Dickson [2, p. 286] to Liouville (1857), that the sum of the cubes of the number of divisors of each of the divisors of an integer, is equal to the square of their sum. For example, the divisors of 6 are 1, 2, 3, and 6, which have 1, 2, 2, and 4 divisors respectively, and Pagni observed, as have others, including Mason et al. [4, p. 179], that the reason Liouville’s result works is because the numbers generated are element-by-element products of sequences of the form {1, 2, ..., t}, which are well known to have the sum of their cubes equal to the square of their sum.