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.

A305436 Number of divisors of n of the form 2^k + 1 for k >= 0.

Table of values

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

List of values

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