A058865 - cp's OEIS frontend

A058865 Irregular table a(n,k) = number of connected labeled chordal graphs on n nodes with k edges, containing no induced path P_4, for n >= 1, 1 <= k <= n*(n-1)/2, read by rows; also the number of labeled trees with each vertex replaced by a clique.

n	a(n)
1	1
2	0
3	3
4	1
5	0
6	0
7	4
8	12
9	6
10	1
11	0
12	0
13	0
14	5
15	30
16	75
17	30
18	30
19	10
20	1
21	0
22	0
23	0
24	0
25	6
26	60
27	270
28	360
29	435
30	270
31	255
32	80
33	60
34	15
35	1
36	0
37	0
38	0
39	0
40	0
41	7
42	105
43	735
44	1925
45	2940
46	3591
47	4165
48	2310
49	2520
50	1925
51	882
52	630
53	175
54	105
55	21
56	1
57	0
58	0
59	0
60	0
61	0
62	0
63	8
64	168
65	1680
66	7280
67	16800

[1, 0, 3, 1, 0, 0, 4, 12, 6, 1, 0, 0, 0, 5, 30, 75, 30, 30, 10, 1, 0, 0, 0, 0, 6, 60, 270, 360, 435, 270, 255, 80, 60, 15, 1, 0, 0, 0, 0, 0, 7, 105, 735, 1925, 2940, 3591, 4165, 2310, 2520, 1925, 882, 630, 175, 105, 21, 1, 0, 0, 0, 0, 0, 0, 8, 168, 1680, 7280, 16800]

cp's OEIS Frontend

A058865 Irregular table a(n,k) = number of connected labeled chordal graphs on n nodes with k edges, containing no induced path P_4, for n >= 1, 1 <= k <= n*(n-1)/2, read by rows; also the number of labeled trees with each vertex replaced by a clique.

Table of values

List of values