STATUS
reviewed
approved
The OEIS is supported by the many generous donors to the OEIS Foundation.
reviewed
approved
proposed
reviewed
editing
proposed
(Python)
from itertools import islice
from sympy import divisor_count
def A353960_gen(): # generator of terms
adict, a = {}, 1
yield a
while True:
if a in adict:
adict[a] += 1
a *= adict[a]
else:
adict[a] = 1
a //= divisor_count(a)
yield a
A353960_list = list(islice(A353960_gen(), 30)) # Chai Wah Wu, Jun 04 2022
approved
editing
proposed
approved
editing
proposed
Conjecture: C(m) = A125057(m) + k, where k is the number of divisors d of m such that 1 < d <= C(m/d). The cardinality of m due to occurrences of novel terms is A125057(m), whereas the cardinality due to repeat terms is is counted by k, and all of the latter terms occur prior to any of the former. (Note comments in A125057, A126888, A125056, concerning definitions of those sequences.)
approved
editing
reviewed
approved
proposed
reviewed
editing
proposed