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.

A368314 a(n) is the number of numbers that can be obtained by replacing any positive number without leading zeros, say m, appearing in the binary expansion of n by one of the divisors of m.

Table of values

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

List of values

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