A309748 - cp's OEIS frontend

A309748 The number of non-equivalent distinguishing coloring partitions of the path on n vertices (n>=1) with exactly k parts (k>=1). Regular triangle read by rows: the rows are indexed by n, the number of vertices of the path, and the columns are indexed by k, the number of parts.

n	a(n)
1	1
2	0
3	1
4	0
5	1
6	1
7	0
8	4
9	4
10	1
11	0
12	6
13	14
14	6
15	1
16	0
17	16
18	49
19	37
20	9
21	1
22	0
23	28
24	154
25	182
26	76
27	12
28	1
29	0
30	64
31	496
32	876
33	542
34	142
35	16
36	1
37	0
38	120
39	1520
40	3920
41	3522
42	1346
43	242
44	20
45	1
46	0
47	256
48	4705
49	17175
50	21392
51	11511
52	2980
53	390
54	25
55	1
56	0
57	496
58	14266
59	73030
60	123665
61	89973
62	32141
63	5990
64	595
65	30
66	1

[1, 0, 1, 0, 1, 1, 0, 4, 4, 1, 0, 6, 14, 6, 1, 0, 16, 49, 37, 9, 1, 0, 28, 154, 182, 76, 12, 1, 0, 64, 496, 876, 542, 142, 16, 1, 0, 120, 1520, 3920, 3522, 1346, 242, 20, 1, 0, 256, 4705, 17175, 21392, 11511, 2980, 390, 25, 1, 0, 496, 14266, 73030, 123665, 89973, 32141, 5990, 595, 30, 1]

cp's OEIS Frontend

A309748 The number of non-equivalent distinguishing coloring partitions of the path on n vertices (n>=1) with exactly k parts (k>=1). Regular triangle read by rows: the rows are indexed by n, the number of vertices of the path, and the columns are indexed by k, the number of parts.

Table of values

List of values