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.

A361223 Maximum number of inequivalent permutations of a partition of n, where two permutations are equivalent if they are reversals of each other.

Table of values

n a(n)
1 1
2 1
3 1
4 2
5 2
6 4
7 6
8 10
9 16
10 30
11 54
12 84
13 140
14 252
15 420
16 756
17 1260
18 2520
19 4620
20 7920
21 13860
22 27720
23 51480
24 90120
25 180180
26 337890
27 600600
28 1081080
29 2042040
30 3675672
31 6348888
32 12252240
33 23279256
34 42325920
35 77597520
36 148140720
37 271591320
38 480507720
39 892371480

List of values

[1, 1, 1, 2, 2, 4, 6, 10, 16, 30, 54, 84, 140, 252, 420, 756, 1260, 2520, 4620, 7920, 13860, 27720, 51480, 90120, 180180, 337890, 600600, 1081080, 2042040, 3675672, 6348888, 12252240, 23279256, 42325920, 77597520, 148140720, 271591320, 480507720, 892371480]