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.

A327693 Triangle read by rows: T(n,k) is the number of n-bead necklace structures which are not self-equivalent under a nonzero rotation using exactly k different colored beads.

Table of values

n a(n)
1 1
2 0
3 0
4 0
5 1
6 0
7 0
8 1
9 1
10 0
11 0
12 3
13 5
14 2
15 0
16 0
17 4
18 13
19 9
20 2
21 0
22 0
23 9
24 43
25 50
26 20
27 3
28 0
29 0
30 14
31 116
32 206
33 127
34 31
35 3
36 0
37 0
38 28
39 335
40 862
41 772
42 293
43 51
44 4
45 0
46 0
47 48
48 920
49 3384
50 4226
51 2263
52 580
53 72
54 4
55 0
56 0
57 93
58 2591
59 13250
60 22430
61 16317
62 5817
63 1080
64 105
65 5
66 0

List of values

[1, 0, 0, 0, 1, 0, 0, 1, 1, 0, 0, 3, 5, 2, 0, 0, 4, 13, 9, 2, 0, 0, 9, 43, 50, 20, 3, 0, 0, 14, 116, 206, 127, 31, 3, 0, 0, 28, 335, 862, 772, 293, 51, 4, 0, 0, 48, 920, 3384, 4226, 2263, 580, 72, 4, 0, 0, 93, 2591, 13250, 22430, 16317, 5817, 1080, 105, 5, 0]