Dividing sextuplets
Public  11/20/14  10xp  Programming  41.2% 
There is an obvious generalization of p183 from Philippe. Find all 1 < a < b < c < d < e < f (integer) sextuplets for that
(a1)*(b1)*(c1)*(d1)*(e1)*(f1) divides a*b*c*d*e*f1. You can easily check that this is a valid sextuplet:
[3, 5, 17, 257, 65555, 226112997].
Answer format: cnt,s
where cnt is the number of solutions and s is the sum of a+b+c+d+e+f values over all solutions.
My timing: <1 sec.
(a1)*(b1)*(c1)*(d1)*(e1)*(f1) divides a*b*c*d*e*f1. You can easily check that this is a valid sextuplet:
[3, 5, 17, 257, 65555, 226112997].
Answer format: cnt,s
where cnt is the number of solutions and s is the sum of a+b+c+d+e+f values over all solutions.
My timing: <1 sec.
Fresh Problems

Polygons ratio 3d
solved by 8 
Best Matrices Multiplication 1w:2d
solved by 10 
Equations 1w:6d
solved by 10 
First semiprime 2w:3d
solved by 10 
Triangles ratio 3w:1d
solved by 12