login
A324605
Triangle read by rows: T(n,k) is the number of maximal-length non-intersecting loops starting at (0,0) on the n X k torus consisting of steps up and to the right, 1 <= k <= n.
0
2, 1, 2, 1, 5, 6, 1, 2, 11, 8, 1, 9, 14, 19, 30, 1, 2, 3, 2, 29, 12, 1, 13, 76, 27, 99, 41, 126, 1, 2, 23, 8, 171
OFFSET
1,1
COMMENTS
Conjecture: T(2n,2) = 2 for all n.
Conjecture: T(2n+1,2) = 4n+1 for all n.
Conjecture: T(n,n) = A056188(n) for n > 1.
FORMULA
T(1,n) = 1 for n > 1.
T(n,n) is even for all n.
EXAMPLE
Table begins:
2;
1, 2;
1, 5, 6;
1, 2, 11, 8;
1, 9, 14, 19, 30;
1, 2, 3, 2, 29, 12;
1, 13, 76, 27, 99, 41, 126;
CROSSREFS
Cf, A306779.
Sequence in context: A102551 A217437 A152823 * A086545 A337395 A126083
KEYWORD
nonn,tabl,more,walk
AUTHOR
Peter Kagey, Mar 09 2019
STATUS
approved