Number of m for which a+b+c = n; abc = m has at least two distinct solutions (a,b,c) with 1 <= a <= b <= c.

A060277

Number of m for which a+b+c = n; abc = m has at least two distinct solutions (a,b,c) with 1 <= a <= b <= c.

Terms

    a(0) =0a(1) =0a(2) =0a(3) =0a(4) =0a(5) =0a(6) =0a(7) =0a(8) =0a(9) =0a(10) =0a(11) =0a(12) =1a(13) =2a(14) =0a(15) =1a(16) =1a(17) =0a(18) =1a(19) =1a(20) =3a(21) =1a(22) =1a(23) =1a(24) =1a(25) =3a(26) =2a(27) =7a(28) =3a(29) =2

External references