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.

Showing 1-1 of 1 results.

A198317 Number of, not necessarily connected, regular simple graphs on n vertices with girth exactly 7.

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 2, 2, 3, 4, 4, 7, 5, 27, 7, 553, 10, 30379, 13, 1782854, 18, 95079100, 24, 4686063134, 32
Offset: 0

Views

Author

Jason Kimberley, Dec 18 2012

Keywords

Crossrefs

Not necessarily connected regular simple graphs girth exactly g: A198313 (g=3), A198314 (g=4), A198315 (g=5), A198316 (g=6), this sequence (g=7), A198318 (g=8).

Formula

a(n) = A186747(n) + A210717(n).
a(n) = A185317(n) - A185318(n).
Showing 1-1 of 1 results.