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 A306779 #17 Oct 28 2021 07:10:25 %S A306779 1,2,4,3,5,9,4,8,11,16,5,9,14,19,25,6,12,18,24,29,36,7,13,19,27,33,41 %N A306779 Table read by rows: T(n,k) is the length of the longest non-intersecting loop starting at (0,0) on the n X k torus consisting of steps up and to the right, 1 <= k <= n. %C A306779 Conjecture: T(n,k) = n*k if and only if k = 1 or gcd(n,k) > 1. %e A306779 Table begins: %e A306779 1; %e A306779 2, 4; %e A306779 3, 5, 9; %e A306779 4, 8, 11, 16; %e A306779 5, 9, 14, 19, 25; %e A306779 6, 12, 18, 24, 29, 36; %Y A306779 Cf. A324604. %K A306779 tabl,nonn,more,walk %O A306779 1,2 %A A306779 _Peter Kagey_, Mar 09 2019