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.

A204981 Least 2^(k-1) such that n divides 2^(k-1)-2^(j-1) for some j

Table of values

n a(n)
1 2
2 4
3 4
4 8
5 16
6 8
7 8
8 16
9 64
10 32
11 1024
12 16
13 4096
14 16
15 16
16 32
17 256
18 128
19 262144
20 64
21 64
22 2048
23 2048
24 32
25 1048576
26 8192
27 262144
28 32
29 268435456
30 32
31 32
32 64
33 1024
34 512
35 4096
36 256
37 68719476736
38 524288
39 4096
40 128
41 1048576
42 128
43 16384
44 4096
45 4096

List of values

[2, 4, 4, 8, 16, 8, 8, 16, 64, 32, 1024, 16, 4096, 16, 16, 32, 256, 128, 262144, 64, 64, 2048, 2048, 32, 1048576, 8192, 262144, 32, 268435456, 32, 32, 64, 1024, 512, 4096, 256, 68719476736, 524288, 4096, 128, 1048576, 128, 16384, 4096, 4096]