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 A363362 #7 Jun 02 2023 08:39:09 %S A363362 1,1,2,6,21,108,827,10908,259567,11704426 %N A363362 Number of connected weakly pancyclic graphs on n unlabeled nodes. %C A363362 A graph is weakly pancyclic if it contains cycles of all lengths between its girth and its circumference. Acyclic graphs are considered to be weakly pancyclic. The concept of weak pancyclicity was introduced by Brandt, Faudree, and Goddard (1998). %H A363362 Stephan Brandt, Ralph Faudree, and Wayne Goddard, <a href="https://doi.org/10.1002/(SICI)1097-0118(199803)27:3%3C141::AID-JGT3%3E3.0.CO;2-O">Weakly pancyclic graphs</a>, Journal of Graph Theory 27 (1998), 141-176. %F A363362 a(n) = A001349(n) - A363363(n). %F A363362 a(n) = A001349(n) for n <= 5, because all graphs on at most 5 nodes are weakly pancyclic. %Y A363362 Cf. A001349, A286684, A363363, A363364. %K A363362 nonn,more %O A363362 1,3 %A A363362 _Pontus von Brömssen_, May 29 2023