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.

A373382 a(n) = gcd(A329697(n), A331410(n)), where A329697, A331410 give the number of iterations needed to reach a power of 2, when using the map n -> n-(n/p), or respectively, n -> n+(n/p), where p is the largest prime factor of n.

Table of values

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

List of values

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