A363845 - cp's OEIS frontend

A363845 Triangle read by rows: T(n,k) = number of connected n-node graphs with k nodes in distinguished bipartite block, k = 0..n.

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

[1, 1, 1, 0, 1, 0, 0, 1, 1, 0, 0, 1, 2, 1, 0, 0, 1, 4, 4, 1, 0, 0, 1, 6, 13, 6, 1, 0, 0, 1, 9, 34, 34, 9, 1, 0, 0, 1, 12, 76, 150, 76, 12, 1, 0, 0, 1, 16, 155, 558, 558, 155, 16, 1, 0, 0, 1, 20, 290, 1824, 3529, 1824, 290, 20, 1, 0, 0, 1, 25, 510, 5375, 19687, 19687, 5375, 510, 25, 1, 0, 0, 1, 30, 853, 14549, 98726, 194203, 98726, 14549, 853, 30, 1, 0]

cp's OEIS Frontend

A363845 Triangle read by rows: T(n,k) = number of connected n-node graphs with k nodes in distinguished bipartite block, k = 0..n.

Table of values

List of values