|
Search: id:A027686
|
|
|
| A027686 |
|
Number of ways to transform say (((((((ab)c)d)e)f)g)h) to (a(b(c(d(e(f(gh))))))) where there are n multiplications (hence n+1 variables), by repeatedly applying the one-way associative law ((xy)z) -> (x(yz)). |
|
+0
1
|
| |
|
|
|
|
Search completed in 0.002 seconds
|
