cp's OEIS Frontend

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.

A324604 Table read by rows: T(n,k) is the number of non-intersecting loops starting at (0,0) on the n X k torus consisting of steps up and to the right, 1 <= k <= n.

This page as a plain text file.
%I A324604 #20 Oct 28 2021 07:10:50
%S A324604 2,2,4,2,7,22,2,13,66,258,2,25,189,898,3528,2,49,537,3118,14545,87830,
%T A324604 2,97,1544,11462,75446,746589,8295536,2,193,4508,44990,447667
%N A324604 Table read by rows: T(n,k) is the number of 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 A324604 Conjecture: Second column is A181565.
%H A324604 Peter Kagey, <a href="https://codegolf.stackexchange.com/q/181203/53884">Cycles on the torus</a>, Programming Puzzles & Code Golf Stack Exchange.
%e A324604 The T(3,2) = 7 walks on the 3 X 2 torus are:
%e A324604   (0,0),(0,1),(0,0)
%e A324604   (0,0),(1,0),(2,0),(0,0)
%e A324604   (0,0),(0,1),(1,1),(1,0),(2,0),(0,0)
%e A324604   (0,0),(0,1),(1,1),(2,1),(2,0),(0,0)
%e A324604   (0,0),(1,0),(1,1),(2,1),(0,1),(0,0)
%e A324604   (0,0),(1,0),(1,1),(2,1),(2,0),(0,0)
%e A324604   (0,0),(1,0),(2,0),(2,1),(0,1),(0,0)
%e A324604 Table begins:
%e A324604   2
%e A324604   2,  4,
%e A324604   2,  7,   22,
%e A324604   2, 13,   66,   258,
%e A324604   2, 25,  189,   898,  3528,
%e A324604   2, 49,  537,  3118, 14545,  87830,
%e A324604   2, 97, 1544, 11462, 75446, 746589, 8295536
%Y A324604 Cf. A181565, A324603.
%K A324604 tabl,more,nonn,walk
%O A324604 1,1
%A A324604 _Peter Kagey_, Mar 09 2019