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 A336281 #46 Aug 30 2021 04:06:13 %S A336281 2,6,41,318,3108,32243,350575,3896568 %N A336281 Total number of ways of embedding connected graphs with n edges in the square lattice with diagonals allowed. %C A336281 The embedding must map edges in the graph onto either horizontal or vertical grid lines of length 1 or diagonals of length sqrt(2). Vertices in the graph must map onto lattice points, and of course must preserve the incidence structure of the graph. A square in the lattice may have both diagonals present - their intersection does not count as an incidence. %C A336281 Configurations differing only a rotation or reflection are not counted as different. %C A336281 The resulting figures are variously called 'polysticks', 'polyedges' or 'polyforms'. %H A336281 N. J. A. Sloane, <a href="/A336281/a336281_1.pdf">Illustration for a(1)=2, a(2)=6, a(3)=41.</a> [Thanks to Peter Munn for correcting errors in my first drawing.] %Y A336281 Without diagonal edges, we get A019988. %Y A336281 Cf. A052436. %K A336281 nonn,hard,more,nice %O A336281 1,1 %A A336281 _James W. Anderson_, Jul 15 2020 %E A336281 a(7)-a(8) from _John Mason_, Aug 17 2021