cp's OEIS Frontend

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.

A185317 Number of, not necessarily connected, regular simple graphs on n vertices with girth at least 7.

Original entry on oeis.org

1, 1, 2, 1, 2, 1, 2, 2, 3, 2, 3, 2, 3, 2, 4, 3, 5, 4, 6, 5, 7, 7, 9, 9, 13, 12, 18, 16, 41, 21, 572, 28, 30402, 37, 1782884, 49, 95079141, 64, 4686063195, 84
Offset: 0

Views

Author

Jason Kimberley, Dec 12 2012

Keywords

Crossrefs

Not necessarily connected regular simple graphs with girth at least g: A005176 (g=3), A185314 (g=4), A185315 (g=5), A185316 (g=6), this sequence (g=7), A185318 (g=8), A185319 (g=9).

Formula

a(n) = A186727(n) + A185217(n).