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 A096267 #25 Dec 06 2023 01:57:33 %S A096267 2,6,22,88,372,1628,7312,33466,155446,730534,3466170,16576874, %T A096267 79810756,386458826,1880580352,9190830700,45088727820,221945045488, %U A096267 1095798917674,5424898610958,26922433371778,133906343014110,667370905196930,3332257266746004 %N A096267 Number of fixed polyedges with n edges (number of ways of embedding connected undirected graphs with n edges into the plane square lattice, inequivalent up to translation). %C A096267 Found using the rooted method (also known as Redelmeier's algorithm). %H A096267 Alexander Malkis, <a href="https://wwwbroy.in.tum.de/~malkis/Malkis-dipl.pdf">Polyedges, polyominoes and the 'Digit' game</a>, diploma thesis in computer science, Universität des Saarlandes, 2003, Saarbrücken. %H A096267 Stephan Mertens and Cristopher Moore, <a href="https://doi.org/10.1088/1751-8121/aae65c">Series expansion of the percolation threshold on hypercubic lattices</a>, J. Phys. A: Math. Theor., 51 (2018), 475001. See Table 1. %e A096267 _|_|_ is a polyedge with 5 edges %Y A096267 Cf. A019988 for "free" polyedges, A348096. %Y A096267 6th row of A366767. %K A096267 nonn %O A096267 1,1 %A A096267 _Alexander Malkis_, Jun 22 2004 %E A096267 a(22)-a(24) from Mertens & Moore added by _Andrey Zabolotskiy_, Feb 01 2022