A186733 - cp's OEIS frontend

A186733 Triangular array C(n,r) = number of connected r-regular graphs, having girth exactly 3, with n nodes, for 0 <= r < n.

n	a(n)
1	0
2	0
3	0
4	0
5	0
6	1
7	0
8	0
9	0
10	1
11	0
12	0
13	0
14	0
15	1
16	0
17	0
18	0
19	1
20	1
21	1
22	0
23	0
24	0
25	0
26	2
27	0
28	1
29	0
30	0
31	0
32	3
33	5
34	3
35	1
36	1
37	0
38	0
39	0
40	0
41	16
42	0
43	4
44	0
45	1
46	0
47	0
48	0
49	13
50	57
51	59
52	21
53	5
54	1
55	1
56	0
57	0
58	0
59	0
60	263
61	0
62	266
63	0
64	6
65	0
66	1
67	0
68	0
69	0
70	63
71	1532
72	7847
73	7848
74	1547
75	94
76	9
77	1
78	1
79	0
80	0
81	0
82	0
83	10747
84	0
85	367860
86	0
87	10786

[0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 2, 0, 1, 0, 0, 0, 3, 5, 3, 1, 1, 0, 0, 0, 0, 16, 0, 4, 0, 1, 0, 0, 0, 13, 57, 59, 21, 5, 1, 1, 0, 0, 0, 0, 263, 0, 266, 0, 6, 0, 1, 0, 0, 0, 63, 1532, 7847, 7848, 1547, 94, 9, 1, 1, 0, 0, 0, 0, 10747, 0, 367860, 0, 10786]

cp's OEIS Frontend

A186733 Triangular array C(n,r) = number of connected r-regular graphs, having girth exactly 3, with n nodes, for 0 <= r < n.

Table of values

List of values