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.

A345933 a(n) = n / gcd(n, A002034(n)), where A002034(n) gives the smallest positive integer k such that n divides k!.

Table of values

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

List of values

[1, 1, 1, 1, 1, 2, 1, 2, 3, 2, 1, 3, 1, 2, 3, 8, 1, 3, 1, 4, 3, 2, 1, 6, 5, 2, 3, 4, 1, 6, 1, 4, 3, 2, 5, 6, 1, 2, 3, 8, 1, 6, 1, 4, 15, 2, 1, 8, 7, 5, 3, 4, 1, 6, 5, 8, 3, 2, 1, 12, 1, 2, 9, 8, 5, 6, 1, 4, 3, 10, 1, 12, 1, 2, 15, 4, 7, 6, 1, 40, 9, 2, 1, 12, 5, 2, 3, 8, 1, 15, 7, 4, 3, 2, 5, 12, 1, 7, 9, 10, 1, 6, 1, 8, 15]