A232006 - cp's OEIS frontend

A232006 Triangular array read by rows: T(n,k) is the number of simple labeled graphs on vertex set {1,2,...,n} with exactly k components (all of which are trees) such that the labels {1,2,...,k} are all in distinct components (trees), n >= 0, 0 <= k <= n.

n	a(n)
0	1
1	0
2	1
3	0
4	1
5	1
6	0
7	3
8	2
9	1
10	0
11	16
12	8
13	3
14	1
15	0
16	125
17	50
18	15
19	4
20	1
21	0
22	1296
23	432
24	108
25	24
26	5
27	1
28	0
29	16807
30	4802
31	1029
32	196
33	35
34	6
35	1
36	0
37	262144
38	65536
39	12288
40	2048
41	320
42	48
43	7
44	1
45	0
46	4782969
47	1062882
48	177147
49	26244
50	3645
51	486
52	63
53	8
54	1
55	0
56	100000000
57	20000000
58	3000000
59	400000
60	50000
61	6000
62	700
63	80
64	9
65	1

[1, 0, 1, 0, 1, 1, 0, 3, 2, 1, 0, 16, 8, 3, 1, 0, 125, 50, 15, 4, 1, 0, 1296, 432, 108, 24, 5, 1, 0, 16807, 4802, 1029, 196, 35, 6, 1, 0, 262144, 65536, 12288, 2048, 320, 48, 7, 1, 0, 4782969, 1062882, 177147, 26244, 3645, 486, 63, 8, 1, 0, 100000000, 20000000, 3000000, 400000, 50000, 6000, 700, 80, 9, 1]

cp's OEIS Frontend

A232006 Triangular array read by rows: T(n,k) is the number of simple labeled graphs on vertex set {1,2,...,n} with exactly k components (all of which are trees) such that the labels {1,2,...,k} are all in distinct components (trees), n >= 0, 0 <= k <= n.

Table of values

List of values