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 A360031 #6 Mar 31 2023 09:17:34 %S A360031 0,1,1,1,2,5,14,35,111,341,1130,3969,15002,58429,239045,1012241 %N A360031 a(n) is the number of unlabeled 2-connected graphs with n edges containing at least one pair of nodes with resistance distance 1 when all edges are replaced by unit resistors. %H A360031 Hugo Pfoertner, <a href="/A360031/a360031.pdf">Illustration of terms a(3)-a(7)</a>, 2023. %Y A360031 Cf. A010355, A339070, A342558, A360030. %K A360031 nonn,more %O A360031 3,5 %A A360031 _Hugo Pfoertner_, Mar 11 2023