On the divisors of natural and happy numbers: a study based on entropy and graphs

The features of numerical sequences and time series have been studied by using entropies and graphs. In this article, two sequences derived from the divisors of natural numbers are investigated. These sequences are obtained either directly from the divisor function or by recursively applying the divisor function. For comparison purposes, analogous sequences formed from the divisors of happy numbers are also examined. Firstly, the informational entropy of these four sequences is numerically determined. Then, each sequence is mapped into graphs by employing two visibility algorithms. For each graph, the average degree, the average shortest-path length, the average clustering coefficient, and the degree distribution are calculated. Also, the links in these graphs are quantified in terms of the parity of the numbers that these links connect. These computer experiments suggest that the four analyzed sequences exhibit characteristics of quasi-random sequences.

Automated summary

The features of numerical sequences and time series are investigated using entropies and graphs in this article. Two sequences derived from the divisors of natural numbers are studied and compared with sequences formed from the divisors of happy numbers. The sequences are analyzed numerically using informational entropy and mapped into graphs using visibility algorithms, showing characteristics of quasi-random sequences.