A070166 - cp's OEIS frontend

A070166 Irregular triangle read by rows giving T(n,k) = number of rooted graphs on n + 1 nodes with k edges (n >= 0, 0 <= k <= n(n-1)/2).

n	a(n)
0	1
1	1
2	1
3	1
4	2
5	2
6	1
7	1
8	2
9	4
10	6
11	4
12	2
13	1
14	1
15	2
16	5
17	11
18	17
19	18
20	17
21	11
22	5
23	2
24	1
25	1
26	2
27	5
28	13
29	29
30	52
31	76
32	94
33	94
34	76
35	52
36	29
37	13
38	5
39	2
40	1
41	1
42	2
43	5
44	14
45	35
46	83
47	173
48	308
49	487
50	666
51	774
52	774
53	666
54	487
55	308
56	173
57	83
58	35
59	14
60	5
61	2
62	1
63	1
64	2
65	5
66	14
67	37
68	98
69	252
70	585
71	1239
72	2396
73	4135
74	6340

[1, 1, 1, 1, 2, 2, 1, 1, 2, 4, 6, 4, 2, 1, 1, 2, 5, 11, 17, 18, 17, 11, 5, 2, 1, 1, 2, 5, 13, 29, 52, 76, 94, 94, 76, 52, 29, 13, 5, 2, 1, 1, 2, 5, 14, 35, 83, 173, 308, 487, 666, 774, 774, 666, 487, 308, 173, 83, 35, 14, 5, 2, 1, 1, 2, 5, 14, 37, 98, 252, 585, 1239, 2396, 4135, 6340]

cp's OEIS Frontend

A070166 Irregular triangle read by rows giving T(n,k) = number of rooted graphs on n + 1 nodes with k edges (n >= 0, 0 <= k <= n(n-1)/2).

Table of values

List of values