A343870 - cp's OEIS frontend

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

n	a(n)
1	1
2	0
3	0
4	0
5	1
6	0
7	0
8	0
9	1
10	0
11	0
12	0
13	1
14	1
15	0
16	0
17	0
18	1
19	2
20	1
21	0
22	0
23	0
24	0
25	3
26	3
27	1
28	0
29	0
30	0
31	0
32	2
33	9
34	4
35	1
36	0
37	0
38	0
39	0
40	1
41	13
42	20
43	6
44	1
45	0
46	0
47	0
48	0
49	0
50	11
51	49
52	40
53	7
54	1
55	0
56	0
57	0
58	0
59	0
60	5
61	77
62	158
63	70
64	9
65	1
66	0
67	0
68	0
69	0
70	0
71	2
72	75
73	406
74	426
75	121
76	11
77	1
78	0
79	0
80	0
81	0
82	0
83	0
84	47
85	662
86	1645
87	1018
88	189
89	13
90	1
91	0

[1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 0, 1, 2, 1, 0, 0, 0, 0, 3, 3, 1, 0, 0, 0, 0, 2, 9, 4, 1, 0, 0, 0, 0, 1, 13, 20, 6, 1, 0, 0, 0, 0, 0, 11, 49, 40, 7, 1, 0, 0, 0, 0, 0, 5, 77, 158, 70, 9, 1, 0, 0, 0, 0, 0, 2, 75, 406, 426, 121, 11, 1, 0, 0, 0, 0, 0, 0, 47, 662, 1645, 1018, 189, 13, 1, 0]

cp's OEIS Frontend

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

Table of values

List of values