A343873 - cp's OEIS frontend

A343873 Triangle read by rows: T(n,k) is the number of unlabeled connected planar graphs with n edges and k nodes (n >= 0, 1 <= k <= n + 1).

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

[1, 0, 1, 0, 0, 1, 0, 0, 1, 2, 0, 0, 0, 2, 3, 0, 0, 0, 1, 5, 6, 0, 0, 0, 1, 5, 13, 11, 0, 0, 0, 0, 4, 19, 33, 23, 0, 0, 0, 0, 2, 22, 67, 89, 47, 0, 0, 0, 0, 1, 19, 107, 236, 240, 106, 0, 0, 0, 0, 0, 13, 130, 486, 797, 657, 235, 0, 0, 0, 0, 0, 5, 130, 804, 2075, 2678, 1806, 551]

cp's OEIS Frontend

A343873 Triangle read by rows: T(n,k) is the number of unlabeled connected planar graphs with n edges and k nodes (n >= 0, 1 <= k <= n + 1).

Table of values

List of values