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.

A332563 a(n) = minimal positive k 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 k exists.

Table of values

n a(n)
1 1
2 6
3 253
4 160
5 23
6 6
7 577
8 14
9 1
10 4
11 383
12 8
13 1591
14 18
15 169
16 42
17 1879
18 210
19 57
20 20
21 69
22 1354
23 13
24 86
25 225
26 1532
27 577
28 300
29 13
30 30
31 6419
32 312
33 30639
34 12
35 151
36 8
37 89
38 2720
39 29
40 5830
41 1
42 1450
43 195
44 478
45 55
46 166528
47 127
48 1074
49 3559
50 252
51 41

List of values

[1, 6, 253, 160, 23, 6, 577, 14, 1, 4, 383, 8, 1591, 18, 169, 42, 1879, 210, 57, 20, 69, 1354, 13, 86, 225, 1532, 577, 300, 13, 30, 6419, 312, 30639, 12, 151, 8, 89, 2720, 29, 5830, 1, 1450, 195, 478, 55, 166528, 127, 1074, 3559, 252, 41]