A387431 - cp's OEIS frontend

A387431 Triangle read by rows: T(n,k) is the number of unlabeled simple connected graphs with n vertices and treedepth k.

n	a(n)
1	1
2	0
3	1
4	0
5	1
6	1
7	0
8	1
9	4
10	1
11	0
12	1
13	10
14	9
15	1
16	0
17	1
18	25
19	64
20	21
21	1
22	0
23	1
24	62
25	380
26	363
27	46
28	1
29	0
30	1
31	137
32	2196
33	6103
34	2567
35	112
36	1
37	0
38	1
39	294
40	10963
41	89989
42	135673
43	23868
44	291
45	1
46	0
47	1
48	599
49	51051
50	1055752
51	5663404
52	4628772
53	316124
54	867
55	1
56	0
57	1
58	1187
59	230003
60	10805643
61	164689853
62	575441978
63	249531330
64	5997608
65	2961
66	1

[1, 0, 1, 0, 1, 1, 0, 1, 4, 1, 0, 1, 10, 9, 1, 0, 1, 25, 64, 21, 1, 0, 1, 62, 380, 363, 46, 1, 0, 1, 137, 2196, 6103, 2567, 112, 1, 0, 1, 294, 10963, 89989, 135673, 23868, 291, 1, 0, 1, 599, 51051, 1055752, 5663404, 4628772, 316124, 867, 1, 0, 1, 1187, 230003, 10805643, 164689853, 575441978, 249531330, 5997608, 2961, 1]

cp's OEIS Frontend

A387431 Triangle read by rows: T(n,k) is the number of unlabeled simple connected graphs with n vertices and treedepth k.

Table of values

List of values