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.

A205124 Least s(k) such that n divides s(k)-s(j) for some j where s(j)= j*(2^(j-1)).

Table of values

n a(n)
1 4
2 12
3 4
4 12
5 32
6 80
7 32
8 12
9 192
10 32
11 12
12 80
13 448
14 32
15 192
16 80
17 80
18 192
19 80
20 32
21 5120
22 1024
23 448
24 80
25 2304
26 448
27 11264
28 32
29 2304
30 192
31 32
32 192
33 1024
34 80
35 5120
36 192
37 448
38 80
39 11264
40 192
41 53248
42 5120
43 524288
44 1024
45 192
46 448
47 192
48 80
49 2304
50 2304

List of values

[4, 12, 4, 12, 32, 80, 32, 12, 192, 32, 12, 80, 448, 32, 192, 80, 80, 192, 80, 32, 5120, 1024, 448, 80, 2304, 448, 11264, 32, 2304, 192, 32, 192, 1024, 80, 5120, 192, 448, 80, 11264, 192, 53248, 5120, 524288, 1024, 192, 448, 192, 80, 2304, 2304]