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.

A369878 Array read by antidiagonals: T(n,k) is the number of length n necklaces using at most k colors in which the convex hull of a set of beads of any color A cannot be transformed by rotation into the convex hull of a set of beads of any other color B (n >= 1, k >= 1).

Table of values

n a(n)
1 1
2 2
3 1
4 3
5 2
6 1
7 4
8 3
9 4
10 1
11 5
12 4
13 9
14 4
15 1
16 6
17 5
18 16
19 9
20 8
21 1
22 7
23 6
24 25
25 16
26 27
27 12
28 1
29 8
30 7
31 36
32 25
33 64
34 93
35 20
36 1
37 9
38 8
39 49
40 36
41 125
42 304
43 243
44 32
45 1
46 10
47 9
48 64
49 49
50 216
51 705
52 928
53 699
54 60
55 1
56 11
57 10
58 81
59 64
60 343
61 1356
62 2405
63 4384
64 2019
65 104
66 1

List of values

[1, 2, 1, 3, 2, 1, 4, 3, 4, 1, 5, 4, 9, 4, 1, 6, 5, 16, 9, 8, 1, 7, 6, 25, 16, 27, 12, 1, 8, 7, 36, 25, 64, 93, 20, 1, 9, 8, 49, 36, 125, 304, 243, 32, 1, 10, 9, 64, 49, 216, 705, 928, 699, 60, 1, 11, 10, 81, 64, 343, 1356, 2405, 4384, 2019, 104, 1]