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

A185226 Number of disconnected 2-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, 1, 1, 2, 2, 3, 3, 5, 5, 7, 8, 10, 11, 15, 16, 20, 23, 28, 31, 39, 43, 52, 59, 70, 79, 95, 106, 125, 142, 166, 187, 220, 247, 287, 325, 375, 423, 490, 551, 633, 715, 818, 921, 1055, 1186, 1352, 1522, 1729, 1943, 2208
Offset: 0

Views

Author

Jason Kimberley, Feb 22 2011

Keywords

Comments

Number of partitions of n with each part at least 6, and at least 2 parts.

Crossrefs

Disconnected k-regular simple graphs with girth at least 6: A185216 (all k), A185206 (triangle); this sequence (k=2), A185236 (k=3), A185246 (k=4).
Disconnected 2-regular simple graphs with girth at least g: A165652 (g=3), A185224 (g=4), A185225 (g=5), this sequence (g=6), A185227 (g=7), A185228 (g=8), A185229 (g=9).

Programs

Formula

a(n) = A185326(n) - A185116(n).

A185217 Number of disconnected regular simple graphs on n vertices with girth at least 7.

Original entry on oeis.org

0, 0, 1, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 3, 2, 4, 3, 5, 4, 6, 6, 8, 8, 11, 11, 14, 15, 19, 20, 25, 27, 33, 36, 43, 48, 57, 63, 74, 83, 97, 108, 126, 141, 163, 183, 210, 236, 272, 304, 350, 390, 471, 498, 1175, 635, 32957, 807, 1886322, 1022, 101215816, 1291, 5025322391
Offset: 0

Views

Author

Jason Kimberley, Oct 27 2012

Keywords

Crossrefs

Disconnected regular graphs with girth at least g: A068932 (g=3), A185214 (g=4), A185215 (g=5), A185216 (g=6), this sequence (g=7).
Disconnected k-regular simple graphs with girth at least 7: this sequence (all k), A185207 (triangle); A185227 (k=2), A185237 (k=3).

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

Original entry on oeis.org

1, 1, 2, 1, 2, 1, 3, 2, 3, 2, 3, 2, 4, 3, 6, 4, 7, 5, 13, 7, 42, 10, 398, 13, 7592, 18, 181251, 25, 4624534, 33, 122090591, 45, 3328930034, 61, 93990693977, 106
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), this sequence (g=6), A185317 (g=7), A185318 (g=8), A185319 (g=9).

Formula

a(n) = A186726(n) + A185216(n).

A185236 Number of disconnected 3-regular simple graphs on 2n 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, 1, 1, 6, 37, 432, 8119, 191254, 4855919, 127937854, 3482858263, 98176518259
Offset: 0

Views

Author

Jason Kimberley, Feb 22 2011

Keywords

Crossrefs

Disconnected k-regular simple graphs with girth at least 6: A185216 (all k), A185206 (triangle); A185226 (k=2), this sequence (k=3), A185246 (k=4).

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

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).

A185218 Number of disconnected regular simple graphs on n vertices with girth at least 8.

Original entry on oeis.org

0, 0, 1, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 3, 2, 4, 3, 5, 4, 6, 5, 8, 7, 10, 10, 13, 13, 17, 17, 22, 23, 28, 30, 37, 39, 47, 51, 61, 66, 78, 85, 100, 110, 127, 140, 163, 179, 206, 228, 261, 289, 330, 365, 416, 461, 522, 579, 657, 726, 819, 909, 1024, 1134, 1277, 1411
Offset: 0

Views

Author

Jason Kimberley, Dec 14 2012

Keywords

Crossrefs

Disconnected regular graphs with girth at least g: A068932 (g=3), A185214 (g=4), A185215 (g=5), A185216 (g=6), A185217 (g=7), this sequence (g=8).

A185206 Triangular array D(n,k) counting disconnected k-regular simple graphs on n vertices with girth at least 6.

Original entry on oeis.org

0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 2, 1, 0, 2, 1, 1, 3, 1, 0, 3, 1, 1, 5, 1, 0, 5, 1, 1, 7, 1, 0, 8, 1, 1, 10, 1, 0, 11, 1, 1, 15, 1, 0, 16, 1, 1, 20, 1, 0, 23, 1, 1, 28, 1, 1, 0, 31, 0, 1, 1, 39, 1, 1, 0, 43, 0, 1, 1, 52, 6, 1, 0, 59, 0, 1, 1, 70, 37, 1, 0, 79, 0
Offset: 1

Views

Author

Jason Kimberley, Nov 03 2012

Keywords

Examples

			1: 0;
2: 1;
3: 1;
4: 1, 1;
5: 1, 0;
6: 1, 1;
7: 1, 0;
8: 1, 1;
9: 1, 0;
10: 1, 1;
11: 1, 0;
12: 1, 1, 1;
13: 1, 0, 1;
14: 1, 1, 2;
15: 1, 0, 2;
16: 1, 1, 3;
17: 1, 0, 3;
18: 1, 1, 5;
19: 1, 0, 5;
20: 1, 1, 7;
21: 1, 0, 8;
22: 1, 1, 10;
23: 1, 0, 11;
24: 1, 1, 15;
25: 1, 0, 16;
26: 1, 1, 20;
27: 1, 0, 23;
28: 1, 1, 28, 1;
29: 1, 0, 31, 0;
30: 1, 1, 39, 1;
31: 1, 0, 43, 0;
32: 1, 1, 52, 6;
33: 1, 0, 59, 0;
34: 1, 1, 70, 37;
35: 1, 0, 79, 0;
36: 1, 1, 95, 432;
37: 1, 0, 106, 0;
38: 1, 1, 125, 8119;
39: 1, 0, 142, 0;
40: 1, 1, 166, 191254;
41: 1, 0, 187, 0;
42: 1, 1, 220, 4855919;
43: 1, 0, 247, 0;
44: 1, 1, 287, 127937854;
45: 1, 0, 325, 0;
46: 1, 1, 375, 3482858263;
47: 1, 0, 423, 0;
48: 1, 1, 490, 98176518259;
49: 1, 0, 551, 0;
		

Crossrefs

Disconnected k-regular simple graphs with girth at least 6: A185216 (all k), this sequence (triangle); A185226 (k=2), A185236 (k=3), A185246 (k=4).

A185219 Number of disconnected regular simple graphs on n vertices with girth at least 9.

Original entry on oeis.org

0, 0, 1, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 3, 2, 4, 3, 5, 4, 6, 5, 7, 7, 9, 9, 12, 12, 15, 16, 19, 20, 25, 26, 31, 34, 40, 43, 51, 55, 64, 71, 81, 89, 103, 113, 129, 143, 162, 179, 204, 225, 254, 282, 317, 351, 396, 437, 490, 544, 608, 673, 753, 832, 928, 1028, 1144, 1264
Offset: 0

Views

Author

Jason Kimberley, Dec 19 2012

Keywords

Examples

			a(116) = 89574 because there is 1 such 0-regular graph (116 disconnected vertices), 1 such 1-regular graph (58 loose edges), A185229(116) = 89401, and 171 such 3-regular graphs (because A210709(58)=18).
		

Crossrefs

Disconnected regular graphs with girth at least g: A068932 (g=3), A185214 (g=4), A185215 (g=5), A185216 (g=6), A185217 (g=7), A185218 (g=8), this sequence (g=9).

A210715 Number of disconnected regular simple graphs on n vertices with girth exactly 5.

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 2, 2, 3, 3, 4, 6, 6, 9, 9, 22, 13, 82, 18, 618, 26, 7164, 36, 107862, 50, 1876730, 70, 35924810, 95, 741405213, 131, 16356067216, 323, 383931367731, 132977
Offset: 0

Views

Author

Jason Kimberley, Dec 10 2012

Keywords

Formula

a(n) = A185215(n) - A185216(n).

A210716 Number of disconnected regular simple graphs on n vertices with girth exactly 6.

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 2, 2, 3, 3, 4, 4, 6, 6, 8, 9, 12, 12, 17, 17, 27, 24, 66, 32, 472, 44, 8172, 60, 191325, 80, 4856015, 107, 127937980, 143, 3482858430, 188, 98176518479, 248
Offset: 0

Views

Author

Jason Kimberley, Dec 10 2012

Keywords

Formula

a(n) = A185216(n) - A185217(n).
Showing 1-10 of 10 results.