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.

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

Table of values

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

List of values

[2, 3, 2, 3, 4, 5, 4, 3, 6, 4, 3, 5, 7, 4, 6, 5, 5, 6, 5, 4, 10, 8, 7, 5, 9, 7, 11, 4, 9, 6, 4, 6, 8, 5, 10, 6, 7, 5, 11, 6, 13, 10, 16, 8, 6, 7, 6, 5, 9, 9, 8, 7, 10, 11, 13, 6, 14, 9, 8, 6, 16, 8, 10, 7, 17, 9, 15, 5, 12, 10]