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.

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

Table of values

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

List of values

[1, 2, 3, 4, 5, 3, 7, 8, 9, 5, 11, 4, 13, 7, 3, 16, 17, 9, 19, 5, 7, 11, 23, 3, 25, 13, 27, 4, 29, 6, 31, 32, 3, 17, 5, 9, 37, 19, 13, 8, 41, 7, 43, 4, 5, 23, 47, 16, 49, 25, 3, 13, 53, 27, 11, 8, 19, 29, 59, 4, 61, 31, 7, 64, 13, 6, 67, 17, 3, 5, 71, 9, 73, 37, 25, 4, 11, 13, 79]