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.

A073752 Greatest common divisor of n/spf(n) and n/gpf(n) where spf(n) is the smallest and gpf(n) is the greatest prime factor of n (see A020639, A006530).

Table of values

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

List of values

[1, 1, 1, 2, 1, 1, 1, 4, 3, 1, 1, 2, 1, 1, 1, 8, 1, 3, 1, 2, 1, 1, 1, 4, 5, 1, 9, 2, 1, 3, 1, 16, 1, 1, 1, 6, 1, 1, 1, 4, 1, 3, 1, 2, 3, 1, 1, 8, 7, 5, 1, 2, 1, 9, 1, 4, 1, 1, 1, 6, 1, 1, 3, 32, 1, 3, 1, 2, 1, 5, 1, 12, 1, 1, 5, 2, 1, 3, 1, 8, 27, 1, 1, 6, 1, 1, 1, 4, 1, 9, 1, 2, 1, 1, 1, 16, 1, 7, 3, 10, 1]