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 A243562 #16 Sep 12 2023 12:19:30 %S A243562 1,0,1,1,2,3,8,21,79,334,2190 %N A243562 Number of simple connected graphs with n nodes that are Eulerian and have no subgraph isomorphic to diamond graph. %H A243562 Travis Hoppe and Anna Petrone, <a href="https://github.com/thoppe/Encyclopedia-of-Finite-Graphs">Encyclopedia of Finite Graphs</a> %Y A243562 Cf. A242790 (diamond free graphs), A003049 (Eulerian graphs). %K A243562 nonn,more %O A243562 1,5 %A A243562 _Travis Hoppe_ and _Anna Petrone_, Jun 06 2014 %E A243562 a(11) from _Max Alekseyev_, Sep 12 2023