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.

A316431 Least common multiple divided by greatest common divisor of the integer partition with Heinz number n > 1.

Table of values

n a(n)
2 1
3 1
4 1
5 1
6 2
7 1
8 1
9 1
10 3
11 1
12 2
13 1
14 4
15 6
16 1
17 1
18 2
19 1
20 3
21 2
22 5
23 1
24 2
25 1
26 6
27 1
28 4
29 1
30 6
31 1
32 1
33 10
34 7
35 12
36 2
37 1
38 8
39 3
40 3
41 1
42 4
43 1
44 5
45 6
46 9
47 1
48 2
49 1
50 3
51 14
52 6
53 1
54 2
55 15
56 4
57 4
58 10
59 1
60 6
61 1
62 11
63 2
64 1
65 2
66 10
67 1
68 7
69 18
70 12
71 1
72 2
73 1
74 12
75 6
76 8
77 20
78 6
79 1
80 3
81 1
82 13
83 1
84 4
85 21
86 14
87 5
88 5
89 1
90 6
91 6
92 9
93 22
94 15
95 24
96 2
97 1
98 4
99 10
100 3
101 1
102 14
103 1
104 6
105 12

List of values

[1, 1, 1, 1, 2, 1, 1, 1, 3, 1, 2, 1, 4, 6, 1, 1, 2, 1, 3, 2, 5, 1, 2, 1, 6, 1, 4, 1, 6, 1, 1, 10, 7, 12, 2, 1, 8, 3, 3, 1, 4, 1, 5, 6, 9, 1, 2, 1, 3, 14, 6, 1, 2, 15, 4, 4, 10, 1, 6, 1, 11, 2, 1, 2, 10, 1, 7, 18, 12, 1, 2, 1, 12, 6, 8, 20, 6, 1, 3, 1, 13, 1, 4, 21, 14, 5, 5, 1, 6, 6, 9, 22, 15, 24, 2, 1, 4, 10, 3, 1, 14, 1, 6, 12]