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.

A352998 a(n) is the least k > 0 such that the binary expansions of A109812(n) and A109812(n + 2*k) have no common 1-bit.

Table of values

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

List of values

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