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.

A324393 a(n) is the number of such divisors d of n that A000120(d) does not divide n, where A000120(d) gives the binary weight of d.

Table of values

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

List of values

[0, 0, 1, 0, 1, 0, 1, 0, 2, 0, 1, 0, 1, 2, 3, 0, 1, 0, 1, 0, 1, 2, 1, 0, 2, 2, 3, 3, 1, 2, 1, 0, 2, 0, 3, 0, 1, 2, 2, 0, 1, 0, 1, 3, 5, 2, 1, 0, 2, 2, 3, 3, 1, 2, 2, 4, 2, 2, 1, 0, 1, 2, 3, 0, 3, 0, 1, 0, 2, 4, 1, 0, 1, 2, 4, 3, 3, 2, 1, 0, 3, 2, 1, 0, 3, 2, 3, 4, 1, 4, 3, 0, 3, 2, 3, 0, 1, 4, 4, 3, 1, 2, 1, 4, 4]