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.

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.

Terms

    a(0) =20a(1) =21a(2) =14a(3) =220a(4) =208a(5) =791a(6) =161a(7) =181a(8) =2330a(9) =181a(10) =134a(11) =25068a(12) =181a(13) =92a(14) =24243a(15) =181a(16) =1774a(17) =22681a(18) =92a(19) =22282a(20) =22140a(21) =531a(22) =181a(23) =62a(24) =21885a(25) =1427a(26) =181a(27) =2320401a(28) =21213a(29) =20737

External references