a(n) is the number of solutions to the "sum equals product" riddle with n prices v_j, i.e., find positive integers v_j, v_{j+1}>=v_j such that 100^(n-1)*Sum_{k=1..n} v_k = Product_{k=1..n} v_k.

A382510

a(n) is the number of solutions to the "sum equals product" riddle with n prices v_j, i.e., find positive integers v_j, v_{j+1}>=v_j such that 100^(n-1)*Sum_{k=1..n} v_k = Product_{k=1..n} v_k.