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.

A294881 Number of proper divisors of n that are irreducible when their binary expansion is interpreted as polynomial over GF(2).

Table of values

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

List of values

[0, 0, 0, 1, 0, 2, 0, 1, 1, 1, 0, 2, 0, 2, 1, 1, 0, 2, 0, 1, 2, 2, 0, 2, 0, 2, 1, 2, 0, 2, 0, 1, 2, 1, 1, 2, 0, 2, 2, 1, 0, 3, 0, 2, 1, 1, 0, 2, 1, 2, 1, 2, 0, 2, 1, 2, 2, 1, 0, 2, 0, 2, 2, 1, 1, 3, 0, 1, 1, 2, 0, 2, 0, 2, 2, 2, 2, 3, 0, 1, 1, 2, 0, 3, 0, 1, 1, 2, 0, 2, 2, 1, 2, 2, 1, 2, 0, 2, 2, 2, 0, 2, 0, 2, 2]