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.

A248756 a(n) = smallest k such that a(n-k) and n have the same number of 1's in their binary expansions, or a(n) = n if no such k exists.

Table of values

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

List of values

[1, 1, 3, 2, 2, 3, 7, 3, 1, 2, 4, 4, 6, 7, 15, 4, 4, 5, 5, 1, 7, 1, 8, 5, 4, 5, 12, 7, 14, 15, 31, 7, 6, 1, 3, 1, 5, 6, 9, 1, 9, 10, 13, 1, 15, 1, 16, 6, 6, 7, 6, 2, 8, 9, 24, 6, 12, 13, 28, 15, 30, 31, 63, 11, 8, 9, 3, 1, 5, 6, 10, 1, 9, 10, 14, 1, 16, 17, 17]