A263293 - cp's OEIS frontend

A263293 Triangle read by rows: T(n,k) is the number of unlabeled simple graphs with n vertices and maximum vertex degree k, (0 <= k < n).

n	a(n)
1	1
2	1
3	1
4	1
5	1
6	2
7	1
8	2
9	4
10	4
11	1
12	2
13	8
14	12
15	11
16	1
17	3
18	15
19	43
20	60
21	34
22	1
23	3
24	25
25	121
26	360
27	378
28	156
29	1
30	4
31	41
32	378
33	2166
34	4869
35	3843
36	1044
37	1
38	4
39	65
40	1095
41	14306
42	68774
43	113622
44	64455
45	12346
46	1
47	5
48	100
49	3441
50	104829
51	1141597
52	3953162
53	4605833
54	1921532
55	274668

[1, 1, 1, 1, 1, 2, 1, 2, 4, 4, 1, 2, 8, 12, 11, 1, 3, 15, 43, 60, 34, 1, 3, 25, 121, 360, 378, 156, 1, 4, 41, 378, 2166, 4869, 3843, 1044, 1, 4, 65, 1095, 14306, 68774, 113622, 64455, 12346, 1, 5, 100, 3441, 104829, 1141597, 3953162, 4605833, 1921532, 274668]

cp's OEIS Frontend

A263293 Triangle read by rows: T(n,k) is the number of unlabeled simple graphs with n vertices and maximum vertex degree k, (0 <= k < n).

Table of values

List of values