A046742 - cp's OEIS frontend

A046742 Triangle of number of connected graphs with k >= 1 edges and n nodes (2 <= n <= k+1).

n	a(n)
1	1
2	0
3	1
4	0
5	1
6	2
7	0
8	0
9	2
10	3
11	0
12	0
13	1
14	5
15	6
16	0
17	0
18	1
19	5
20	13
21	11
22	0
23	0
24	0
25	4
26	19
27	33
28	23
29	0
30	0
31	0
32	2
33	22
34	67
35	89
36	47
37	0
38	0
39	0
40	1
41	20
42	107
43	236
44	240
45	106
46	0
47	0
48	0
49	1
50	14
51	132
52	486
53	797
54	657
55	235
56	0
57	0
58	0
59	0
60	9
61	138
62	814
63	2075
64	2678
65	1806
66	551
67	0
68	0
69	0
70	0
71	5
72	126
73	1169
74	4495
75	8548
76	8833
77	5026
78	1301

[1, 0, 1, 0, 1, 2, 0, 0, 2, 3, 0, 0, 1, 5, 6, 0, 0, 1, 5, 13, 11, 0, 0, 0, 4, 19, 33, 23, 0, 0, 0, 2, 22, 67, 89, 47, 0, 0, 0, 1, 20, 107, 236, 240, 106, 0, 0, 0, 1, 14, 132, 486, 797, 657, 235, 0, 0, 0, 0, 9, 138, 814, 2075, 2678, 1806, 551, 0, 0, 0, 0, 5, 126, 1169, 4495, 8548, 8833, 5026, 1301]

cp's OEIS Frontend

A046742 Triangle of number of connected graphs with k >= 1 edges and n nodes (2 <= n <= k+1).

Table of values

List of values