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.

A309651 T(n,k) is the number of non-equivalent distinguishing colorings of the cycle on n vertices with exactly k colors (k>=1). Regular triangle read by rows, n >= 1, 1 <= k <= n.

Table of values

n a(n)
1 0
2 0
3 0
4 0
5 0
6 1
7 0
8 0
9 3
10 3
11 0
12 0
13 12
14 24
15 12
16 0
17 1
18 34
19 124
20 150
21 60
22 0
23 2
24 111
25 588
26 1200
27 1080
28 360
29 0
30 6
31 315
32 2484
33 7845
34 11970
35 8820
36 2520
37 0
38 14
39 933
40 10240
41 46280
42 105840
43 129360
44 80640
45 20160
46 0
47 30
48 2622
49 40464
50 254664
51 821592
52 1481760
53 1512000
54 816480
55 181440

List of values

[0, 0, 0, 0, 0, 1, 0, 0, 3, 3, 0, 0, 12, 24, 12, 0, 1, 34, 124, 150, 60, 0, 2, 111, 588, 1200, 1080, 360, 0, 6, 315, 2484, 7845, 11970, 8820, 2520, 0, 14, 933, 10240, 46280, 105840, 129360, 80640, 20160, 0, 30, 2622, 40464, 254664, 821592, 1481760, 1512000, 816480, 181440]