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.

Previous Showing 11-12 of 12 results.

A185163 Number of not necessarily connected 6-regular simple graphs on n vertices with girth exactly 3.

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 0, 1, 1, 4, 21, 266, 7848, 367860, 21609300, 1470293675, 113314233804, 9799685588955
Offset: 0

Views

Author

Jason Kimberley, Mar 21 2012

Keywords

Crossrefs

Not necessarily connected k-regular simple graphs girth exactly 3: A198313 (any k), A185643 (triangle); fixed k: A026796 (k=2), A185133 (k=3), A185143 (k=4), A185153 (k=5), this sequence (k=6).

Formula

a(n) = A165627(n) - A185364(n).
a(n) = A184953(n) + A185053(n).

A339847 The number of labeled 6-regular graphs on n nodes.

Original entry on oeis.org

1, 0, 0, 0, 0, 0, 0, 1, 105, 30016, 11180820, 5188453830, 2977635137862, 2099132870973600, 1803595358964773088, 1872726690127181663775, 2329676580698022197516875, 3443086402825299720403673760, 5997229769947050271535917422040, 12218901113752712984458458475480428
Offset: 0

Views

Author

Atabey Kaygun, Dec 21 2020

Keywords

Crossrefs

Column k=6 of A059441.
Cf. A165627 (unlabeled case), A295193.

Programs

  • PARI
    \\ Needs GraphsByDegreeSeq from links in A295193.
    a(n)={my(M=GraphsByDegreeSeq(n, 6, (p,r)->6-valuation(p,x) <= r)); if(n>=7, vecsum(M[,2]), n==0)} \\ Andrew Howroyd, Dec 26 2020

Extensions

Terms a(14) and beyond from Andrew Howroyd, Dec 26 2020
Previous Showing 11-12 of 12 results.