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.

A252374 a(n) = exponent k for the smallest r such that r^k <= spf(n) and gpf(n) < r^(k+1), for some k >= 0, where spf and gpf (smallest and greatest prime factor of n) are given by A020639(n) and A006530(n).

Table of values

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

List of values

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