|
评论
|
简单的路径是自动清空的步行。
注:n X 2网格上从(1,1)到(n,2)的路径数与顺序匹配A086347号.
示例:a(2)=从(1,1)到(2,3)的24条路径
1 [(1, 1), (2, 1), (1, 2), (1, 3), (2, 3)]
2 [(1, 1), (2, 2), (1, 3), (2, 3)]
3 [(1, 1), (2, 2), (2, 1), (1, 2), (2, 3)]
4 [(1, 1), (1, 2), (2, 1), (2, 2), (1, 3), (2, 3)]
5 [(1, 1), (2, 2), (2, 1), (1, 2), (1, 3), (2, 3)]
6 [(1, 1), (1, 2), (2, 2), (1, 3), (2, 3)]
7 [(1, 1), (1, 2), (1, 3), (2, 3)]
8 [(1, 1), (2, 2), (1, 3), (1, 2), (2, 3)]
9 [(1, 1), (2, 2), (2, 3)]
10 [(1, 1), (1, 2), (2, 3)]
11 [(1, 1), (2, 2), (1, 2), (1, 3), (2, 3)]
12 [(1, 1), (2, 1), (2, 2), (1, 3), (2, 3)]
13 [(1, 1), (2, 1), (2, 2), (1, 2), (2, 3)]
14 [(1, 1), (2, 1), (1, 2), (1, 3), (2, 2), (2, 3)]
15 [(1, 1), (1, 2), (2, 1), (2, 2), (2, 3)]
16 [(1, 1), (2, 1), (2, 2), (1, 3), (1, 2), (2, 3)]
17 [(1, 1), (2, 1), (1, 2), (2, 3)]
18 [(1, 1), (1, 2), (2, 2), (2, 3)]
19 [(1, 1), (1, 2), (1, 3), (2, 2), (2, 3)]
20 [(1, 1), (2, 1), (2, 2), (1, 2), (1, 3), (2, 3)]
21 [(1, 1), (2, 2), (1, 2), (2, 3)]
22 [(1, 1), (2, 1), (2, 2), (2, 3)]
23[(1,1),(2,1),(1,2),(2,2),(2,3)]
24 [(1, 1), (2, 1), (1, 2), (2, 2), (1, 3), (2, 3)]
|