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.

A343650 a(n) is the number of divisors d of n such that the product d * (n/d) can be computed without carries in binary.

Table of values

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

List of values

[1, 2, 2, 3, 2, 4, 2, 4, 2, 4, 2, 6, 2, 4, 4, 5, 2, 4, 2, 6, 2, 4, 2, 8, 2, 4, 4, 6, 2, 8, 2, 6, 2, 4, 2, 6, 2, 4, 2, 8, 2, 4, 2, 6, 4, 4, 2, 10, 2, 4, 4, 6, 2, 8, 2, 8, 2, 4, 2, 12, 2, 4, 6, 7, 2, 4, 2, 6, 2, 4, 2, 8, 2, 4, 2, 6, 2, 4, 2, 10, 2, 4, 2, 6, 4, 4]