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.

A203398 T(n,k), a triangular array read by rows, is the number of classes of equivalent 2-color n-bead necklaces (turning over is not allowed) that have k necklaces.

Table of values

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

List of values

[2, 2, 1, 2, 0, 2, 2, 1, 0, 3, 2, 0, 0, 0, 6, 2, 1, 2, 0, 0, 9, 2, 0, 0, 0, 0, 0, 18, 2, 1, 0, 3, 0, 0, 0, 30, 2, 0, 2, 0, 0, 0, 0, 0, 56, 2, 1, 0, 0, 6, 0, 0, 0, 0, 99, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 186, 2, 1, 2, 3, 0, 9, 0, 0, 0, 0, 0, 335]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.