A266731 Smallest number of vertices in bi-regular ({3,4};n) graph with girth (shortest cycle) = n.
7, 13, 18, 29, 39, 61, 82, 125
Offset: 4
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.