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.

A205121 Least k such that n divides a difference between distinct numbers j*(2^(j-1)), when ordered as in A205120.

Table of values

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

List of values

[1, 3, 1, 3, 6, 10, 5, 3, 13, 6, 2, 10, 19, 5, 13, 10, 9, 13, 8, 6, 41, 24, 20, 10, 30, 19, 49, 5, 35, 13, 4, 14, 22, 9, 41, 13, 17, 8, 49, 14, 77, 41, 109, 24, 13, 20, 12, 10, 29, 30, 23, 19, 40, 49, 73, 15, 80, 35, 26, 13, 117, 25, 41, 21, 123, 34, 93, 9, 58, 41]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.