{'fraction_non_alphanumeric': 0.02857142857142857, 'fraction_numerical': 0.0027210884353741495, 'mean_word_length': 4.661538461538462, '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}}
On the Constant in the Average Digit Sum for a Recurrence-Based Numeration

Abstract Given an integral, increasing, linear-recurrent sequence A with initial term 1, the greedy algorithm may be used on the terms of A to represent all positive integers. For large classes of recurrences, the average digit sum is known to equal cA log n+O(1), where cA is a positive constant that depends on A. This asymptotic result is re-proved with an elementary approach for a class of special recurrences larger than, or distinct from, that of former papers. The focus is on the constants cA for which, among other items, explicit formulas are provided and minimal values are found, or conjectured, for all special recurrences up to a certain order.