OFFSET
3,1
COMMENTS
A graph on n vertices is said to be pancyclic if there are cycles of each length 3, 4, ... n in the graph.
EXAMPLE
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.
CROSSREFS
KEYWORD
nonn
AUTHOR
John C. George (jgeorge(AT)gdn.edu), Walter D. Wallis (wdwallis(AT)siu.edu) and Alison Marr, Apr 12 2005.
EXTENSIONS
a(14) ... a(22) by Alison Marr, Aug 22 2011.
STATUS
approved