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.

A369925 Number of uniform circular words of length n with adjacent elements unequal using an infinite alphabet up to permutations of the alphabet.

Table of values

n a(n)
0 1
1 0
2 1
3 1
4 2
5 1
6 6
7 1
8 33
9 23
10 295
11 1
12 4877
13 1
14 44191
15 141210
16 749316
17 1
18 31762349
19 1
20 309754506
21 3980911205
22 4704612121
23 1
24 1303743206944
25 55279816357
26 2737023412201
27 343866841144704
28 564548508168226
29 1
30 145630899385513158
31 1
32 2359434158555273239

List of values

[1, 0, 1, 1, 2, 1, 6, 1, 33, 23, 295, 1, 4877, 1, 44191, 141210, 749316, 1, 31762349, 1, 309754506, 3980911205, 4704612121, 1, 1303743206944, 55279816357, 2737023412201, 343866841144704, 564548508168226, 1, 145630899385513158, 1, 2359434158555273239]