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.

A297574 Least integer m > n such that 2^m == 2^n (mod m*n).

Table of values

n a(n)
1 2
2 6
3 15
4 6
5 65
6 8
7 16
8 12
9 63
10 30
11 31
12 16
13 85
14 26
15 39
16 20
17 65
18 72
19 73
20 24
21 57
22 32
23 56
24 32
25 1025
26 170
27 513
28 40
29 85
30 42
31 91
32 40
33 93
34 130
35 155
36 144
37 73
38 56
39 111
40 48
41 341
42 48
43 127
44 64
45 585
46 112
47 2048
48 60
49 2107
50 550
51 195
52 64
53 157
54 1026
55 155
56 80
57 219
58 86
59 233
60 64
61 1261
62 82
63 171
64 73
65 257
66 96
67 595
68 140
69 201
70 130
71 281
72 126

List of values

[2, 6, 15, 6, 65, 8, 16, 12, 63, 30, 31, 16, 85, 26, 39, 20, 65, 72, 73, 24, 57, 32, 56, 32, 1025, 170, 513, 40, 85, 42, 91, 40, 93, 130, 155, 144, 73, 56, 111, 48, 341, 48, 127, 64, 585, 112, 2048, 60, 2107, 550, 195, 64, 157, 1026, 155, 80, 219, 86, 233, 64, 1261, 82, 171, 73, 257, 96, 595, 140, 201, 130, 281, 126]