A381467 - cp's OEIS frontend

A381467 Triangle read by rows: T(n,k) is the number of simple connected graphs on n unlabeled nodes with k cycles and no node a member of more than one cycle, 0 <= k <= floor(n/3).

n	a(n)
0	1
1	1
2	1
3	1
4	1
5	2
6	2
7	3
8	5
9	6
10	13
11	1
12	11
13	33
14	4
15	23
16	89
17	21
18	47
19	240
20	85
21	2
22	106
23	657
24	345
25	16
26	235
27	1806
28	1289
29	109
30	551
31	5026
32	4713
33	627
34	6
35	1301
36	13999
37	16622
38	3259
39	64
40	3159
41	39260
42	57535
43	15576
44	598
45	7741
46	110381
47	195212
48	69983
49	4394
50	18
51	19320
52	311465
53	653318
54	299354
55	28286
56	295

[1, 1, 1, 1, 1, 2, 2, 3, 5, 6, 13, 1, 11, 33, 4, 23, 89, 21, 47, 240, 85, 2, 106, 657, 345, 16, 235, 1806, 1289, 109, 551, 5026, 4713, 627, 6, 1301, 13999, 16622, 3259, 64, 3159, 39260, 57535, 15576, 598, 7741, 110381, 195212, 69983, 4394, 18, 19320, 311465, 653318, 299354, 28286, 295]

cp's OEIS Frontend

A381467 Triangle read by rows: T(n,k) is the number of simple connected graphs on n unlabeled nodes with k cycles and no node a member of more than one cycle, 0 <= k <= floor(n/3).

Table of values

List of values