A309635 - cp's OEIS frontend

A309635 The number of non-equivalent distinguishing coloring partitions of the path on n vertices (n>=1) with at most k parts (k>=1). Square array read by descending antidiagonals: 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	1
3	0
4	1
5	1
6	0
7	1
8	1
9	1
10	0
11	1
12	1
13	2
14	4
15	0
16	1
17	1
18	2
19	8
20	6
21	0
22	1
23	1
24	2
25	9
26	20
27	16
28	0
29	1
30	1
31	2
32	9
33	26
34	65
35	28
36	0
37	1
38	1
39	2
40	9
41	27
42	102
43	182
44	64
45	0
46	1
47	1
48	2
49	9
50	27
51	111
52	364
53	560
54	120
55	0
56	1
57	1
58	2
59	9
60	27
61	112
62	440
63	1436
64	1640
65	256
66	0

[1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 2, 4, 0, 1, 1, 2, 8, 6, 0, 1, 1, 2, 9, 20, 16, 0, 1, 1, 2, 9, 26, 65, 28, 0, 1, 1, 2, 9, 27, 102, 182, 64, 0, 1, 1, 2, 9, 27, 111, 364, 560, 120, 0, 1, 1, 2, 9, 27, 112, 440, 1436, 1640, 256, 0]

cp's OEIS Frontend

A309635 The number of non-equivalent distinguishing coloring partitions of the path on n vertices (n>=1) with at most k parts (k>=1). Square array read by descending antidiagonals: 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