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.

A143771 a(n) = gcd(k + n/k), where k is over all divisors of n.

Table of values

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

List of values

[2, 3, 4, 1, 6, 1, 8, 3, 2, 1, 12, 1, 14, 3, 8, 1, 18, 1, 20, 3, 2, 1, 24, 1, 2, 3, 4, 1, 30, 1, 32, 3, 2, 1, 12, 1, 38, 3, 8, 1, 42, 1, 44, 3, 2, 1, 48, 1, 2, 3, 4, 1, 54, 1, 8, 3, 2, 1, 60, 1, 62, 3, 8, 1, 6, 1, 68, 3, 2, 1, 72, 1, 74, 3, 4, 1, 6, 1, 80, 3, 2, 1, 84, 1, 2, 3, 8, 1, 90, 1, 4, 3, 2, 1, 24, 1]