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.

A143772 If m is the n-th composite, then a(n) = gcd(k + m/k), where k is over all divisors of m.

Table of values

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

List of values

[1, 1, 3, 2, 1, 1, 3, 8, 1, 1, 3, 2, 1, 1, 2, 3, 4, 1, 1, 3, 2, 1, 12, 1, 3, 8, 1, 1, 3, 2, 1, 1, 2, 3, 4, 1, 1, 8, 3, 2, 1, 1, 3, 8, 1, 6, 1, 3, 2, 1, 1, 3, 4, 1, 6, 1, 3, 2, 1, 1, 2, 3, 8, 1, 1, 4, 3, 2, 1, 24, 1, 3, 4, 1, 1, 3, 2, 1, 1, 3, 8, 1, 1, 4, 3, 2, 1, 24, 1, 2, 3, 4, 1, 6, 1, 3, 2, 1, 1, 2, 3, 8, 1, 1, 3]