A076263 - cp's OEIS frontend

A076263 Triangle read by rows: T(n,k) = number of nonisomorphic connected graphs with n vertices and k edges (n >= 1, n-1 <= k <= n(n-1)/2).

n	a(n)
1	1
2	1
3	1
4	1
5	2
6	2
7	1
8	1
9	3
10	5
11	5
12	4
13	2
14	1
15	1
16	6
17	13
18	19
19	22
20	20
21	14
22	9
23	5
24	2
25	1
26	1
27	11
28	33
29	67
30	107
31	132
32	138
33	126
34	95
35	64
36	40
37	21
38	10
39	5
40	2
41	1
42	1
43	23
44	89
45	236
46	486
47	814
48	1169
49	1454
50	1579
51	1515
52	1290
53	970
54	658
55	400
56	220
57	114
58	56
59	24
60	11
61	5
62	2
63	1
64	1
65	47
66	240
67	797
68	2075
69	4495

[1, 1, 1, 1, 2, 2, 1, 1, 3, 5, 5, 4, 2, 1, 1, 6, 13, 19, 22, 20, 14, 9, 5, 2, 1, 1, 11, 33, 67, 107, 132, 138, 126, 95, 64, 40, 21, 10, 5, 2, 1, 1, 23, 89, 236, 486, 814, 1169, 1454, 1579, 1515, 1290, 970, 658, 400, 220, 114, 56, 24, 11, 5, 2, 1, 1, 47, 240, 797, 2075, 4495]

cp's OEIS Frontend

A076263 Triangle read by rows: T(n,k) = number of nonisomorphic connected graphs with n vertices and k edges (n >= 1, n-1 <= k <= n(n-1)/2).

Table of values

List of values