|
Search: id:A117513
|
|
|
| A117513 |
|
Number of ways of arranging 2n tokens in a row, with 2 copies of each token from 1 through n, such that between every pair of tokens labeled i (i=1..n-1) there is exactly one taken labeled i+1. |
|
+0
4
|
| |
|
|
|
|
Search completed in 0.002 seconds
|
