A276640 - cp's OEIS frontend

A276640 Triangle T(n, k) = the number of point-labeled graphs with n points and k edges, no points isolated, no edges isolated. By rows, 0 <= n, ceiling(2*n/3) <= k <= binomial(n, 2).

n	a(n)
1	1
2	3
3	1
4	16
5	15
6	6
7	1
8	125
9	222
10	205
11	120
12	45
13	10
14	1
15	90
16	1356
17	3670
18	5700
19	6165
20	4945
21	2997
22	1365
23	455
24	105
25	15
26	1
27	1680
28	18942
29	69450
30	156870
31	258160
32	331506
33	343140
34	290745
35	202755
36	116175
37	54257
38	20349
39	5985
40	1330
41	210
42	21
43	1

[1, 3, 1, 16, 15, 6, 1, 125, 222, 205, 120, 45, 10, 1, 90, 1356, 3670, 5700, 6165, 4945, 2997, 1365, 455, 105, 15, 1, 1680, 18942, 69450, 156870, 258160, 331506, 343140, 290745, 202755, 116175, 54257, 20349, 5985, 1330, 210, 21, 1]

cp's OEIS Frontend

A276640 Triangle T(n, k) = the number of point-labeled graphs with n points and k edges, no points isolated, no edges isolated. By rows, 0 <= n, ceiling(2*n/3) <= k <= binomial(n, 2).

Table of values

List of values