Number of ways to partition the set of divisors of n into three subsets such that their sums form an integer triangle.
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 20, 0, 0, 0, 0, 0, 21, 0, 14, 0, 0, 0, 220, 0, 0, 0, 0, 0, 208, 0
1 seqfan posts
Sat May 2 16:12:32 CEST 2009 [seqfan] Re: OEIS duplicate hunt