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-17 of 17 results.

A185213 Number of disconnected 11-regular graphs with 2n nodes.

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 13, 8037887, 945095928322681, 187549741420313256356540, 66398446859255608487987488813721, 43100445877221052008718432480116589483823
Offset: 0

Views

Author

Jason Kimberley, Jan 26 2012

Keywords

Links

Crossrefs

11-regular simple graphs: A014384 (connected), this sequence (disconnected).
Disconnected regular simple graphs: A068932 (any degree), A068933 (triangular array), specified degree k: A165652 (k=2), A165653 (k=3), A033483 (k=4), A165655 (k=5), A165656 (k=6), A165877 (k=7), A165878 (k=8), A185293 (k=9), A185203 (k=10), this sequence (k=11).

Extensions

a(15)-a(18) from Andrew Howroyd, May 20 2020

A185293 Number of disconnected 9-regular graphs with 2n nodes.

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 9, 88238, 113315027550, 281342192047999912, 1251394783006077652496450, 9854615127100313024544239975139, 134283364935428822131144679491097123786
Offset: 0

Views

Author

Jason Kimberley, Jan 26 2012

Keywords

Links

Crossrefs

9-regular simple graphs: A014381 (connected), this sequence (disconnected).
Disconnected regular simple graphs: A068932 (any degree), A068933 (triangular array), specified degree k: A157928 (k=0), A157928 (k=1), A165652 (k=2), A165653 (k=3), A033483 (k=4), A165655 (k=5), A165656 (k=6), A165877 (k=7), A165878 (k=8), this sequence (k=9), A185203 (k=10), A185213 (k=11).

Extensions

a(14)-a(17) from Andrew Howroyd, May 20 2020

A185043 Number of disconnected 4-regular simple graphs on n vertices with girth exactly 3.

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 3, 8, 25, 88, 377, 2026, 13349, 104593, 930571, 9124627, 96699740, 1095467916, 13175254799, 167460501260, 2241576473025, 31510509517563, 464047467911837, 7143984462730072, 114749034352969037, 1919656978492976231
Offset: 0

Views

Author

Jason Kimberley, Feb 29 2012

Keywords

Links

Crossrefs

4-regular simple graphs with girth exactly 3: A184943 (connected), this sequence (disconnected), A185143 (not necessarily connected).
Disconnected k-regular simple graphs with girth exactly 3: A210713 (any k), A210703 (triangle); for fixed k: A185033 (k=3), this sequence (k=4), A185053 (k=5), A185063 (k=6).
Disconnected 4-regular simple graphs with girth exactly g: this sequence (g=3), A185044 (g=4).

Formula

a(n) = A033483(n) - A185244(n).

Extensions

Terms a(27)-a(31), due to the extension of A006820 by Andrew Howroyd, from Jason Kimberley, Mar 16 2020

A185246 Number of disconnected 4-regular simple graphs on n vertices with girth at least 6.

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 5, 0, 23, 0, 1301, 25, 495379, 13529
Offset: 0

Views

Author

Jason Kimberley, Feb 22 2011

Keywords

Links

Crossrefs

4-regular simple graphs with girth at least 4: A058348 (connected), this sequence (disconnected), A185346 (not necessarily connected).
Disconnected 4-regular simple graphs with girth at least g: A033483 (g=3), A185244 (g=4), A185245 (g=5), this sequence (g=6).
Disconnected k-regular simple graphs with girth at least 6: A185216 (all k), A185206 (triangle); A185226 (k=2), A185236 (k=3), this sequence (k=4).

Formula

a(n) = A185346(n) - A058348(n) = Euler_transformation(A058348)(n) - A058348(n).

A185245 Number of disconnected 4-regular simple graphs on n vertices with girth at least 5.

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 2, 11, 147, 4215, 132741, 4419691, 141928589, 4339298225, 128489587646
Offset: 0

Views

Author

Jason Kimberley, Feb 22 2011

Keywords

Links

Crossrefs

Disconnected 4-regular simple graphs with girth at least g: A033483 (g=3), A185244 (g=4), this sequence (g=5), A185246 (g=6).

A033700 Number of connected transitive 4-valent (or quartic) graphs with n nodes.

Original entry on oeis.org

1, 1, 1, 3, 3, 3, 2, 10, 3, 5, 7, 13, 4
Offset: 5

Views

Author

Ronald C. Read

Keywords

References

  • R. C. Read and R. J. Wilson, An Atlas of Graphs, Oxford, 1998.

Crossrefs

Cf. A006820, A033301, A033483.

Extensions

a(16)-a(17) from Sean A. Irvine, Jul 13 2020

A173758 Partial sums of A006820.

Original entry on oeis.org

1, 1, 1, 1, 1, 2, 3, 5, 11, 27, 86, 351, 1895, 12673, 100841, 906332, 8943750, 95165384, 1081035906, 13027523553, 165835586734, 2222527601208, 31273800434817, 460941981112256, 7101107185967292, 114127691657536897, 1910229280483131905, 33244227211086415436
Offset: 0

Views

Author

Jonathan Vos Post, Feb 23 2010

Keywords

Comments

Number of connected quartic graphs with at most n nodes.

Crossrefs

Cf. A006820, A033301, A033483.
Connected regular graphs of degree k: A002851 (k=3), A006820 (k=4), A006821 (k=5), A006822 (k=6), A014377 (k=7), A014378 (k=8), A014381 (k=9), A014382 (k=10), A014384 (k=11).

Formula

a(n) = Sum_{k=0..n} A006820(k). [corrected by Georg Fischer, Sep 28 2021]

Extensions

Corrected by Jason Kimberley, Mar 29 2010
Previous Showing 11-17 of 17 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.