One day, one decomposition
A167408: Orderly numbers: a number n is orderly if there exists some number k &gt; tau(n) such that the set of the divisors of n is congruent to the set {1,2,...,tau(n)} mod k
3D graph➡️2D graph➡️#decompwlj
#decompwlj