Recursively divisible numbers

Abstract

We introduce and study the recursive divisor function, a recursive analog of the usual divisor function: κx(n)=nx+∑d⌊nκx(d), where the sum is over the proper divisors of n. We give a geometrical interpretation of κx(n), which we use to derive a relation between κx(n) and κ0(n). For x≥2, we observe that κx(n)/nx<1/(2−ζ(x)). We show that, for n≥2, κ0(n) is twice the number of ordered factorizations, a problem much studied in its own right. By computing those numbers that are more recursively divisible than all of their predecessors, we recover many of the numbers prevalent in design and technology, and suggest new ones which have yet to be adopted.