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.

A068330 Consider all sublists of [(2,1),(3,2,1),(4,3,2,1),...,(n,...,4,3,2,1)] and multiply these permutations in that order. How many of the products are n-cycles?

Table of values

n a(n)
1 1
2 1
3 1
4 2
5 4
6 6
7 11
8 20
9 36
10 65
11 118
12 215
13 389
14 727
15 1366
16 2565
17 4849
18 9123
19 17168
20 32629
21 62121
22 118353
23 226603
24 434512
25 833776
26 1605642
27 3101121
28 5993545
29 11593548
30 22443167
31 43459975
32 84209877
33 163359383
34 317230531
35 616506533
36 1199200964
37 2334860706
38 4549377408
39 8870694723

List of values

[1, 1, 1, 2, 4, 6, 11, 20, 36, 65, 118, 215, 389, 727, 1366, 2565, 4849, 9123, 17168, 32629, 62121, 118353, 226603, 434512, 833776, 1605642, 3101121, 5993545, 11593548, 22443167, 43459975, 84209877, 163359383, 317230531, 616506533, 1199200964, 2334860706, 4549377408, 8870694723]