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.

A322795 Number of integers k, 0 <= k <= n, such that the Damerau-Levenshtein distance between the binary representations of n and k is strictly less than the Levenshtein distance.

Table of values

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

List of values

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