A324163 - cp's OEIS frontend

A324163 Triangle read by rows: T(n,k) is the number of connected k-regular simple graphs on n labeled vertices, (0 <= k < n).

n	a(n)
1	1
2	0
3	1
4	0
5	0
6	1
7	0
8	0
9	3
10	1
11	0
12	0
13	12
14	0
15	1
16	0
17	0
18	60
19	70
20	15
21	1
22	0
23	0
24	360
25	0
26	465
27	0
28	1
29	0
30	0
31	2520
32	19320
33	19355
34	3507
35	105
36	1
37	0
38	0
39	20160
40	0
41	1024380
42	0
43	30016
44	0
45	1
46	0
47	0
48	181440
49	11166120
50	66462480
51	66462606
52	11180820
53	286884
54	945
55	1

[1, 0, 1, 0, 0, 1, 0, 0, 3, 1, 0, 0, 12, 0, 1, 0, 0, 60, 70, 15, 1, 0, 0, 360, 0, 465, 0, 1, 0, 0, 2520, 19320, 19355, 3507, 105, 1, 0, 0, 20160, 0, 1024380, 0, 30016, 0, 1, 0, 0, 181440, 11166120, 66462480, 66462606, 11180820, 286884, 945, 1]

cp's OEIS Frontend

A324163 Triangle read by rows: T(n,k) is the number of connected k-regular simple graphs on n labeled vertices, (0 <= k < n).

Table of values

List of values