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.

A259633 a(n) = number of inequivalent necklaces with beads labeled 1/i (1 <= i <= n) such that the sum of the beads is 1 and the smallest bead is 1/n.

Table of values

n a(n)
1 1
2 1
3 1
4 2
5 1
6 12
7 1
8 43
9 132
10 547
11 1
12 7834
13 1
14 30442
15 608887
16 3834978
17 1
18 84536629
19 1
20 3030450058
21 79538220753
22 16701983083
23 1
24 4136127573912
25 26625599501697
26 2730194738935

List of values

[1, 1, 1, 2, 1, 12, 1, 43, 132, 547, 1, 7834, 1, 30442, 608887, 3834978, 1, 84536629, 1, 3030450058, 79538220753, 16701983083, 1, 4136127573912, 26625599501697, 2730194738935]