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 A385523 #23 Jul 09 2025 14:09:24 %S A385523 2,4,5,8,9,16 %N A385523 Numbers that are not cycle counts of inseparable graphs. %C A385523 Since subdividing edges does not change the inseparability or the cycle count, the sequence holds equally for simple graphs and multigraphs. %H A385523 Ryan McCulloch, Brendan D. McKay, Alireza Salahshoori, and Thomas Zaslavsky, <a href="https://arxiv.org/abs/2507.02260">The Cycle Counts of Graphs</a>, arXiv:2507.02260 [math.CO], 2025. %Y A385523 Cf. A385524 (cubic graphs). %K A385523 nonn,fini,full %O A385523 1,1 %A A385523 _Thomas Zaslavsky_, Jul 01 2025