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.

A082506 a(n) = gcd(2^n, n - phi(n)); largest power of 2 dividing cototient(n) = A051953(n).

Table of values

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

List of values

[2, 1, 1, 2, 1, 4, 1, 4, 1, 2, 1, 8, 1, 8, 1, 8, 1, 4, 1, 4, 1, 4, 1, 16, 1, 2, 1, 16, 1, 2, 1, 16, 1, 2, 1, 8, 1, 4, 1, 8, 1, 2, 1, 8, 1, 8, 1, 32, 1, 2, 1, 4, 1, 4, 1, 32, 1, 2, 1, 4, 1, 32, 1, 32, 1, 2, 1, 4, 1, 2, 1, 16, 1, 2, 1, 8, 1, 2, 1, 16, 1, 2, 1, 4, 1, 4, 1, 16, 1, 2, 1, 16, 1, 16, 1, 64, 1, 8, 1]