A091235 Number of ways to partition the set of divisors of the n-th abundant number into three subsets such that their sums form an integer triangle.

20, 21, 14, 220, 208, 791, 161, 181, 2330, 181, 134, 25068, 181, 92, 24243, 181, 1774, 22681, 92, 22282, 22140, 531, 181, 62, 21885, 1427, 181, 2320401, 21213, 20737, 181, 17188, 701341, 20695, 19950, 16949, 1911, 2159976, 181, 1020