OFFSET
1,2
COMMENTS
Let D(k) = list of the divisors of k in increasing order, and let C = [D(a(1)), D(a(2)), D(a(3)), ...]. The sequence is the lexicographically earliest sequence of positive integers which is equal to the partial sums of C.
Inspired by A389395, which is a similar sequence based on proper divisors.
LINKS
N. J. A. Sloane, Table of n, a(n) for n = 1..11482
EXAMPLE
After a(1)=1, a(2)=2, we have C = [1, 1, 2, ...] with partial sums [1, 2, 4, ...], which suggests taking a(3) = 4, which would give C = [1,1,2,1,2,4,...] with partial sums [1,2,4,5,7,11, ...], which would suggest taking a(4), a(5), a(6) = 5,7,11. From this point on the sequence extends itself uniquely. This is the earliest possible extension, and so IS the sequence.
CROSSREFS
KEYWORD
nonn
AUTHOR
N. J. A. Sloane, Oct 12 2025
STATUS
approved
