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 A360200 #10 Feb 16 2025 08:34:04 %S A360200 0,8,94,1004,14864,334536,11546874,629381852,56094263348, %T A360200 8343512638896,2074276200162230,853966325494701152, %U A360200 578432462293854136504,646135466408339553958096,1200595044818176185884236342 %N A360200 Number of induced paths in the n X n grid graph. %C A360200 Paths of length zero are not counted here. %C A360200 Equivalently, a(n) is the number of snake-like polyominoes in an n X n square. Rotations, reflections and translations are counted separately. %H A360200 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/GridGraph.html">Grid Graph</a> %H A360200 Wikipedia, <a href="https://en.wikipedia.org/wiki/Induced_path">Induced path</a> %e A360200 The a(2) = 8 induced paths are: %e A360200 O O O . . . . O O O O . . O O O %e A360200 . . O . O O . O O . O O O O . O %Y A360200 Main diagonal of A360199. %Y A360200 Cf. A059525, A297664 (induced cycles), A331968, A331986 (of maximum length), A357516. %K A360200 nonn,more %O A360200 1,2 %A A360200 _Andrew Howroyd_, Jan 29 2023