Number of positive integer triples (x,y,z), with x<=y<=z<=n, such that each of x,y and z divides the sum of the other two.
1, 3, 5, 7, 8, 11, 12, 14, 16, 18, 19, 22, 23, 25, 27, 29, 30, 33, 34, 36, 38, 40, 41, 44
1 seqfan posts
Sun May 20 12:51:11 CEST 2012 [seqfan] Mixture of partitioning and divisibility, formulas?