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 A324263 #12 Feb 01 2025 23:17:59 %S A324263 0,1,1,2,5,25,185,2459,58156,2617378 %N A324263 Number of simple connected graphs on n unlabeled nodes with exactly two peripheral nodes. %C A324263 These are the graphs that only have two nodes whose distance from each other is equal to the diameter. An example of such a graph is the path graph. %Y A324263 Column 2 of A324244. %K A324263 nonn,more %O A324263 1,4 %A A324263 _Andrew Howroyd_, Sep 02 2019