|
%I #9 Mar 28 2021 23:03:58
%S 0,1,1,0,1,1,1,1,3,4,0,0,0,0,2,0,0,0,15,42,0,113,0,3,0
%N Number of solutions to product_A+product_B=product_C where A,B,C is a partition of {1,2,...n}.
%H Sean A. Irvine, <a href="https://github.com/archmageirvine/joeis/blob/master/src/irvine/oeis/a045/A045951.java">Java program</a> (github)
%e a(9)=3 since (1 2 6 7)+(4 9)=(3 5 8) and (1 3 4 8 )+(5 6)=(2 7 9) and (1 2 6)+(3 7 8)=(4 5 9).
%K hard,nonn
%O 1,9
%A _Erich Friedman_
%E More terms from _David W. Wilson_.
%E a(21)-a(25) from _Sean A. Irvine_, Mar 28 2021
|
