A051031 - cp's OEIS frontend

A051031 Triangle read by rows: T(n,r) is the number of not necessarily connected r-regular graphs with n nodes, 0 <= r < n.

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

[1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 2, 2, 1, 1, 1, 0, 2, 0, 2, 0, 1, 1, 1, 3, 6, 6, 3, 1, 1, 1, 0, 4, 0, 16, 0, 4, 0, 1, 1, 1, 5, 21, 60, 60, 21, 5, 1, 1, 1, 0, 6, 0, 266, 0, 266, 0, 6, 0, 1, 1, 1, 9, 94, 1547, 7849, 7849, 1547, 94, 9, 1, 1, 1, 0, 10, 0, 10786, 0, 367860, 0, 10786]

cp's OEIS Frontend

A051031 Triangle read by rows: T(n,r) is the number of not necessarily connected r-regular graphs with n nodes, 0 <= r < n.

Table of values

List of values