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.

A357328 Number of permutations p of [n] such that p(i) divides p(j) if i divides j for 1 <= i <= j <= n.

Table of values

n a(n)
0 1
1 1
2 1
3 2
4 1
5 2
6 1
7 2
8 2
9 2
10 1
11 2
12 2
13 6
14 4
15 2
16 2
17 6
18 6
19 24
20 24
21 24
22 6
23 24
24 24
25 24
26 12
27 12
28 12
29 48
30 48
31 240
32 240
33 120
34 48
35 48
36 48
37 240
38 144
39 96
40 96
41 480
42 480
43 2880
44 1440
45 1440
46 720
47 4320
48 4320
49 4320
50 4320
51 2880
52 2880
53 20160
54 20160
55 10080
56 10080
57 10080
58 2880
59 20160
60 20160
61 161280
62 60480
63 60480
64 60480
65 120960

List of values

[1, 1, 1, 2, 1, 2, 1, 2, 2, 2, 1, 2, 2, 6, 4, 2, 2, 6, 6, 24, 24, 24, 6, 24, 24, 24, 12, 12, 12, 48, 48, 240, 240, 120, 48, 48, 48, 240, 144, 96, 96, 480, 480, 2880, 1440, 1440, 720, 4320, 4320, 4320, 4320, 2880, 2880, 20160, 20160, 10080, 10080, 10080, 2880, 20160, 20160, 161280, 60480, 60480, 60480, 120960]