A343088 - cp's OEIS frontend

A343088 Triangle read by rows: T(n,k) is the number of connected labeled graphs with n edges and k vertices, 1 <= k <= n+1.

n	a(n)
0	1
1	0
2	1
3	0
4	0
5	3
6	0
7	0
8	1
9	16
10	0
11	0
12	0
13	15
14	125
15	0
16	0
17	0
18	6
19	222
20	1296
21	0
22	0
23	0
24	1
25	205
26	3660
27	16807
28	0
29	0
30	0
31	0
32	120
33	5700
34	68295
35	262144
36	0
37	0
38	0
39	0
40	45
41	6165
42	156555
43	1436568
44	4782969
45	0
46	0
47	0
48	0
49	10
50	4945
51	258125
52	4483360
53	33779340
54	100000000

[1, 0, 1, 0, 0, 3, 0, 0, 1, 16, 0, 0, 0, 15, 125, 0, 0, 0, 6, 222, 1296, 0, 0, 0, 1, 205, 3660, 16807, 0, 0, 0, 0, 120, 5700, 68295, 262144, 0, 0, 0, 0, 45, 6165, 156555, 1436568, 4782969, 0, 0, 0, 0, 10, 4945, 258125, 4483360, 33779340, 100000000]

cp's OEIS Frontend

A343088 Triangle read by rows: T(n,k) is the number of connected labeled graphs with n edges and k vertices, 1 <= k <= n+1.

Table of values

List of values