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.

A345992 Let m = A344005(n) = smallest m such that n divides m*(m+1); a(n) = gcd(n,m).

Table of values

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

List of values

[1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 3, 1, 2, 5, 1, 1, 2, 1, 4, 3, 2, 1, 8, 1, 2, 1, 7, 1, 5, 1, 1, 11, 2, 7, 4, 1, 2, 3, 5, 1, 6, 1, 11, 9, 2, 1, 3, 1, 2, 17, 4, 1, 2, 5, 7, 3, 2, 1, 15, 1, 2, 9, 1, 5, 11, 1, 4, 23, 14, 1, 8, 1, 2, 3, 19, 7, 6, 1, 5, 1, 2, 1, 4, 17, 2, 29, 8, 1, 9, 13, 23, 3, 2, 19, 32, 1, 2, 11, 4, 1, 17]