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.

A277129 Largest m < n such that 2^m == 2^n (mod n).

Table of values

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

List of values

[0, 1, 1, 3, 1, 4, 4, 7, 3, 6, 1, 10, 1, 11, 11, 15, 9, 12, 1, 16, 15, 12, 12, 22, 5, 14, 9, 25, 1, 26, 26, 31, 23, 26, 23, 30, 1, 20, 27, 36, 21, 36, 29, 34, 33, 35, 24, 46, 28, 30, 43, 40, 1, 36, 35, 53, 39, 30, 1, 56, 1, 57, 57, 63, 53, 56, 1, 60, 47, 58, 36, 66, 64, 38, 55, 58, 47, 66, 40, 76, 27, 62, 1]