A028657 - cp's OEIS frontend

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

n	a(n)
0	1
1	1
2	1
3	1
4	2
5	1
6	1
7	3
8	3
9	1
10	1
11	4
12	7
13	4
14	1
15	1
16	5
17	13
18	13
19	5
20	1
21	1
22	6
23	22
24	36
25	22
26	6
27	1
28	1
29	7
30	34
31	87
32	87
33	34
34	7
35	1
36	1
37	8
38	50
39	190
40	317
41	190
42	50
43	8
44	1
45	1
46	9
47	70
48	386
49	1053
50	1053
51	386
52	70
53	9
54	1
55	1
56	10
57	95
58	734
59	3250
60	5624
61	3250
62	734
63	95
64	10
65	1
66	1
67	11
68	125
69	1324
70	9343
71	28576
72	28576
73	9343
74	1324
75	125
76	11
77	1

[1, 1, 1, 1, 2, 1, 1, 3, 3, 1, 1, 4, 7, 4, 1, 1, 5, 13, 13, 5, 1, 1, 6, 22, 36, 22, 6, 1, 1, 7, 34, 87, 87, 34, 7, 1, 1, 8, 50, 190, 317, 190, 50, 8, 1, 1, 9, 70, 386, 1053, 1053, 386, 70, 9, 1, 1, 10, 95, 734, 3250, 5624, 3250, 734, 95, 10, 1, 1, 11, 125, 1324, 9343, 28576, 28576, 9343, 1324, 125, 11, 1]

cp's OEIS Frontend

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

Table of values

List of values