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 A105206 #18 Aug 18 2025 02:15:00 %S A105206 3,5,6,8,9,10,12,13,14,15,16,17,19,20,21,22,23,24,25,26 %N A105206 Number of edges in a pancyclic graph on n+2 vertices with the fewest possible edges. %C A105206 A graph on n vertices is said to be pancyclic if there are cycles of each length 3, 4, ... n in the graph. %e A105206 For n = 3 the answer is 3; each of the three vertices is connected to each other vertex, forming a 3-cycle. For n = 4 we find it takes five edges and for n = 5 it takes 6. %Y A105206 Different from A080036. %K A105206 nonn,more %O A105206 3,1 %A A105206 John C. George (jgeorge(AT)gdn.edu), Walter D. Wallis (wdwallis(AT)siu.edu) and _Alison Marr_, Apr 12 2005 %E A105206 a(14)-a(22) by _Alison Marr_, Aug 22 2011