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 A366225 #10 Oct 06 2023 03:25:32 %S A366225 1,0,1,0,7,6,87,305,3730,39140 %N A366225 Number of 3-connected unlabeled graphs on n nodes with girth at least 6. %e A366225 The smallest graph in the class is the Heawood graph with 14 vertices. %Y A366225 Cf. A366224 (3-connected graphs of girth at least 5). %K A366225 nonn,hard %O A366225 14,5 %A A366225 _Brendan McKay_, Oct 05 2023