|
Search: id:A045951
|
|
|
| A045951 |
|
Number of solutions to product_A+product_B=product_C where A,B,C is a partition of {1,2,...n}. |
|
+0
1
|
|
| 0, 1, 1, 0, 1, 1, 1, 1, 3, 4, 0, 0, 0, 0, 2, 0, 0, 0, 15, 42
(list; graph; listen)
|
|
|
OFFSET
|
1,9
|
|
|
EXAMPLE
|
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).
|
|
CROSSREFS
|
Sequence in context: A076253 A081174 A132139 this_sequence A025120 A025096 A086798
Adjacent sequences: A045948 A045949 A045950 this_sequence A045952 A045953 A045954
|
|
KEYWORD
|
hard,nonn
|
|
AUTHOR
|
Erich Friedman (erich.friedman(AT)stetson.edu)
|
|
EXTENSIONS
|
More terms from David W. Wilson (davidwwilson(AT)comcast.net).
|
|
|
Search completed in 0.002 seconds
|
