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.

A205125 The number s(j) such that n divides s(k)-s(j), where s(j)=j*(2^(j-1)) and k is the least positive integer for which such a j>0 exists.

Table of values

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

List of values

[1, 4, 1, 4, 12, 32, 4, 4, 12, 12, 1, 32, 32, 4, 12, 32, 12, 12, 4, 12, 80, 12, 80, 32, 4, 32, 32, 4, 448, 12, 1, 32, 1, 12, 80, 12, 4, 4, 32, 32, 11264, 80, 32, 12, 12, 80, 4, 32, 1, 4, 4, 32, 32, 32, 448, 80, 4, 448, 80, 12, 24576, 32, 80, 192, 12, 192, 4, 12, 12, 80]