This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A324605 #21 Apr 05 2020 18:26:04 %S A324605 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, %T A324605 1,2,23,8,171 %N 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. %C A324605 Conjecture: T(2n,2) = 2 for all n. %C A324605 Conjecture: T(2n+1,2) = 4n+1 for all n. %C A324605 Conjecture: T(n,n) = A056188(n) for n > 1. %F A324605 T(1,n) = 1 for n > 1. %F A324605 T(n,n) is even for all n. %e A324605 Table begins: %e A324605 2; %e A324605 1, 2; %e A324605 1, 5, 6; %e A324605 1, 2, 11, 8; %e A324605 1, 9, 14, 19, 30; %e A324605 1, 2, 3, 2, 29, 12; %e A324605 1, 13, 76, 27, 99, 41, 126; %Y A324605 Cf, A306779. %K A324605 nonn,tabl,more,walk %O A324605 1,1 %A A324605 _Peter Kagey_, Mar 09 2019