|
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
|
|
| 1, 2, 12, 136, 2480, 66336, 2446528, 118984832, 7378078464, 568142287360, 53189920492544, 5949749335001088, 783686338494312448, 120058889459865165824, 21166245289132322242560
(list; graph; listen)
|
|
|
Search completed in 0.002 seconds
|
