cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A309785 The number of non-equivalent distinguishing coloring partitions of the cycle on n vertices with at most k parts (k>=1). The cycle graph is defined for n>=3; extended to n=1,2 using the closed form. Square array read by descending antidiagonals: the rows are indexed by n, the number of vertices of the cycle, and the columns are indexed by k, the number of parts.

Table of values

n a(n)
1 0
2 0
3 0
4 0
5 0
6 0
7 0
8 0
9 0
10 0
11 0
12 0
13 1
14 0
15 0
16 0
17 0
18 1
19 1
20 0
21 0
22 0
23 0
24 1
25 2
26 4
27 1
28 0
29 0
30 0
31 1
32 2
33 6
34 9
35 1
36 0
37 0
38 0
39 1
40 2
41 7
42 19
43 26
44 4
45 0
46 0
47 0
48 1
49 2
50 7
51 22
52 58
53 66
54 7
55 0
56 0
57 0
58 1
59 2
60 7
61 23
62 74
63 195
64 183
65 18
66 0
67 0
68 0
69 1
70 2
71 7
72 23
73 77
74 279
75 651
76 488
77 31
78 0

List of values

[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 2, 4, 1, 0, 0, 0, 1, 2, 6, 9, 1, 0, 0, 0, 1, 2, 7, 19, 26, 4, 0, 0, 0, 1, 2, 7, 22, 58, 66, 7, 0, 0, 0, 1, 2, 7, 23, 74, 195, 183, 18, 0, 0, 0, 1, 2, 7, 23, 77, 279, 651, 488, 31, 0]