A008406 - cp's OEIS frontend

A008406 Triangle T(n,k) read by rows, giving number of graphs with n nodes (n >= 1) and k edges (0 <= k <= n(n-1)/2).

n	a(n)
1	1
2	1
3	1
4	1
5	1
6	1
7	1
8	1
9	1
10	2
11	3
12	2
13	1
14	1
15	1
16	1
17	2
18	4
19	6
20	6
21	6
22	4
23	2
24	1
25	1
26	1
27	1
28	2
29	5
30	9
31	15
32	21
33	24
34	24
35	21
36	15
37	9
38	5
39	2
40	1
41	1
42	1
43	1
44	2
45	5
46	10
47	21
48	41
49	65
50	97
51	131
52	148
53	148
54	131
55	97
56	65
57	41
58	21
59	10
60	5
61	2
62	1
63	1
64	1
65	1
66	2
67	5
68	11
69	24
70	56
71	115
72	221
73	402
74	663
75	980
76	1312
77	1557
78	1646
79	1557

[1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 3, 2, 1, 1, 1, 1, 2, 4, 6, 6, 6, 4, 2, 1, 1, 1, 1, 2, 5, 9, 15, 21, 24, 24, 21, 15, 9, 5, 2, 1, 1, 1, 1, 2, 5, 10, 21, 41, 65, 97, 131, 148, 148, 131, 97, 65, 41, 21, 10, 5, 2, 1, 1, 1, 1, 2, 5, 11, 24, 56, 115, 221, 402, 663, 980, 1312, 1557, 1646, 1557]

cp's OEIS Frontend

A008406 Triangle T(n,k) read by rows, giving number of graphs with n nodes (n >= 1) and k edges (0 <= k <= n(n-1)/2).

Table of values

List of values