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.

A332586 a(n) = minimal value of n+k+1 such that the concatenation of the binary expansions of n,n+1,...,n+k is divisible by n+k+1, or -1 if no such n+k+1 exists.

Table of values

n a(n)
1 3
2 9
3 257
4 165
5 29
6 13
7 585
8 23
9 11
10 15
11 395
12 21
13 1605
14 33
15 185
16 59
17 1897
18 229
19 77
20 41
21 91
22 1377
23 37
24 111
25 251
26 1559
27 605
28 329
29 43
30 61
31 6451
32 345
33 30673
34 47
35 187
36 45
37 127
38 2759
39 69
40 5871
41 43
42 1493
43 239
44 523
45 101
46 166575
47 175
48 1123
49 3609
50 303
51 93
52 1139465
53 4495201

List of values

[3, 9, 257, 165, 29, 13, 585, 23, 11, 15, 395, 21, 1605, 33, 185, 59, 1897, 229, 77, 41, 91, 1377, 37, 111, 251, 1559, 605, 329, 43, 61, 6451, 345, 30673, 47, 187, 45, 127, 2759, 69, 5871, 43, 1493, 239, 523, 101, 166575, 175, 1123, 3609, 303, 93, 1139465, 4495201]