OFFSET
1,2
LINKS
David Radcliffe, Table of n, a(n) for n = 1..10000
Project Euler, Problem 88: Product-sum numbers
FORMULA
a(n) <= 2n, since 1^(n-2)*2*n = (n-2)*1 + 2 + n. - Étienne Dupuis, Dec 07 2021
EXAMPLE
a(6)=12 because 6+2+1+1+1+1 = 6*2*1*1*1*1 = 12 is the smallest integer which is the sum and product of the same 6 positive integers.
MATHEMATICA
Table[k=1; While[Select[IntegerPartitions[k, {n}], Total@#==Times@@#&]=={}, k++]; k, {n, 71}] (* Giorgos Kalogeropoulos, Dec 07 2021 *)
CROSSREFS
KEYWORD
easy,nonn
AUTHOR
Louis Marmet (louis(AT)marmet.org), Mar 10 2005
STATUS
approved