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.
For n=2 the a(2)=3 solutions (in standard chess notation) are: (a1,c2,d4,b3), (a2,c1,d2,c3), (a2,c1,d3,b3). For n=3 the a(3)=13 solutions are: (a1,b3,a5,c4,e3,c2), (a1,b3,a5,c6,b4,c2), (a1,b3,a5,c6,d4,c2), (a1,b3,c5,e6,d4,c2), (a2,b4,c2,d4,e2,c1), (a2,b4,c6,d4,b3,c1), (a2,b4,c6,d4,e2,c1), (a2,b4,c6,e5,d3,c1), (a2,b4,d5,c3,e2,c1), (a2,b4,d5,f4,d3,c1), (a2,b4,d5,f4,e2,c1), (a2,c1,d3,f4,d5,c3), (a2,c1,e2,g3,e4,c3).
For n=2 the a(2)=3 solutions (in standard chess notation) are: (a1, c2, d4, b3), (a2, c1, d2, c3), and (a2, c1, d3, b3). Note that each of these three cycles is non-self-intersecting. For the remaining values of n there are two kind of cycles - self-intersecting and non-self-intersecting. For example, a self-intersecting cycle of length 6 is (a1, c2, b4, a2, c1, b3), while the cycle (a1, c2, e1, f3, d4, b3) is non-self-intersecting.
Comments