A106239 - cp's OEIS frontend

A106239 Triangle read by rows: T(n,m) = number of graphs on n labeled nodes, with m components of size = order. Also number of graphs on n labeled nodes with m unicyclic components.

n	a(n)
1	0
2	0
3	0
4	1
5	0
6	0
7	15
8	0
9	0
10	0
11	222
12	0
13	0
14	0
15	0
16	3660
17	10
18	0
19	0
20	0
21	0
22	68295
23	525
24	0
25	0
26	0
27	0
28	0
29	1436568
30	20307
31	0
32	0
33	0
34	0
35	0
36	0
37	33779340
38	727020
39	280
40	0
41	0
42	0
43	0
44	0
45	0
46	880107840
47	25934184
48	31500
49	0
50	0
51	0
52	0
53	0
54	0
55	0
56	25201854045
57	950478210
58	2325015
59	0
60	0
61	0
62	0
63	0
64	0
65	0
66	0

[0, 0, 0, 1, 0, 0, 15, 0, 0, 0, 222, 0, 0, 0, 0, 3660, 10, 0, 0, 0, 0, 68295, 525, 0, 0, 0, 0, 0, 1436568, 20307, 0, 0, 0, 0, 0, 0, 33779340, 727020, 280, 0, 0, 0, 0, 0, 0, 880107840, 25934184, 31500, 0, 0, 0, 0, 0, 0, 0, 25201854045, 950478210, 2325015, 0, 0, 0, 0, 0, 0, 0, 0]

cp's OEIS Frontend

A106239 Triangle read by rows: T(n,m) = number of graphs on n labeled nodes, with m components of size = order. Also number of graphs on n labeled nodes with m unicyclic components.

Table of values

List of values