Smallest number of vertices in trivalent graph with girth (shortest cycle) = n.

A000066

Smallest number of vertices in trivalent graph with girth (shortest cycle) = n.

Terms

    a(0) =4a(1) =6a(2) =10a(3) =14a(4) =24a(5) =30a(6) =58a(7) =70a(8) =112a(9) =126

External references