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.

A344759 a(n) = n divided by the smallest divisor d of n for which A011772(d) = A011772(n), where A011772(n) is the smallest number m such that m(m+1)/2 is divisible by n.

Table of values

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

List of values

[1, 1, 1, 1, 1, 3, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 3, 1, 1, 3, 1, 2, 1, 7, 1, 1, 1, 1, 1, 2, 1, 4, 1, 1, 3, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 5, 1, 3, 2, 1, 3, 1, 1, 1, 1, 1, 3, 1, 4, 1, 1, 1, 1, 1, 2, 3, 1, 1, 6, 1, 1, 1, 2, 1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 3, 1, 1, 3, 1, 2, 1, 4, 1, 1, 1, 1, 3]