A380890 - cp's OEIS frontend

A380890 Triangle T(n,k) read by rows: the number of graphs with n nodes which are enriched cycles (necklaces) and the elements in the cycle are marked linear chains up to length k.

n	a(n)
1	1
2	1
3	2
4	1
5	2
6	4
7	1
8	3
9	5
10	7
11	1
12	3
13	7
14	9
15	12
16	1
17	5
18	14
19	18
20	21
21	24
22	1
23	5
24	19
25	29
26	35
27	38
28	42
29	1
30	8
31	35
32	56
33	71
34	77
35	81
36	85
37	1
38	10
39	60
40	100
41	133
42	148
43	156
44	160
45	165
46	1
47	15
48	107
49	192
50	264
51	297
52	317
53	325
54	330
55	335
56	1
57	19
58	187
59	361
60	511
61	586
62	630
63	650
64	660
65	665
66	671
67	1
68	31
69	352
70	714
71	1041
72	1206
73	1306
74	1350
75	1375
76	1385
77	1391
78	1397

[1, 1, 2, 1, 2, 4, 1, 3, 5, 7, 1, 3, 7, 9, 12, 1, 5, 14, 18, 21, 24, 1, 5, 19, 29, 35, 38, 42, 1, 8, 35, 56, 71, 77, 81, 85, 1, 10, 60, 100, 133, 148, 156, 160, 165, 1, 15, 107, 192, 264, 297, 317, 325, 330, 335, 1, 19, 187, 361, 511, 586, 630, 650, 660, 665, 671, 1, 31, 352, 714, 1041, 1206, 1306, 1350, 1375, 1385, 1391, 1397]

cp's OEIS Frontend

A380890 Triangle T(n,k) read by rows: the number of graphs with n nodes which are enriched cycles (necklaces) and the elements in the cycle are marked linear chains up to length k.

Table of values

List of values