The largest integer not representable as a distinct sum of values of p(j) fo\ (j + 1) (j + 2) (j + 3) (j + 4) r p(j)=, -------------------------------, with j>=j0 in at least, C, 24 different ways for j0 from 0 to, 5, and C from 1 to, 1 By Shalosh B. Ekhad The smallest integer not representable as a sum of distinct values of the po\ (j + 1) (j + 2) (j + 3) (j + 4) lynomial p(j)=, -------------------------------, with j>=, 0, in at least , 24 1, different ways is, 12659 In order to prove this fact you need to check this for all positive integers\ <=, 46376, that we did! The smallest integer not representable as a sum of distinct values of the po\ (j + 1) (j + 2) (j + 3) (j + 4) lynomial p(j)=, -------------------------------, with j>=, 1, in at least , 24 1, different ways is, 23319 In order to prove this fact you need to check this for all positive integers\ <=, 91390, that we did! The smallest integer not representable as a sum of distinct values of the po\ (j + 1) (j + 2) (j + 3) (j + 4) lynomial p(j)=, -------------------------------, with j>=, 2, in at least , 24 1, different ways is, 33134 In order to prove this fact you need to check this for all positive integers\ <=, 148995, that we did! The smallest integer not representable as a sum of distinct values of the po\ (j + 1) (j + 2) (j + 3) (j + 4) lynomial p(j)=, -------------------------------, with j>=, 3, in at least , 24 1, different ways is, 39399 In order to prove this fact you need to check this for all positive integers\ <=, 178365, that we did! The smallest integer not representable as a sum of distinct values of the po\ (j + 1) (j + 2) (j + 3) (j + 4) lynomial p(j)=, -------------------------------, with j>=, 4, in at least , 24 1, different ways is, 41954 In order to prove this fact you need to check this for all positive integers\ <=, 194580, that we did! The smallest integer not representable as a sum of distinct values of the po\ (j + 1) (j + 2) (j + 3) (j + 4) lynomial p(j)=, -------------------------------, with j>=, 5, in at least , 24 1, different ways is, 49024 In order to prove this fact you need to check this for all positive integers\ <=, 249900, that we did!