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.

A036431 a(n) = number of positive integers b which, when added to the number of their divisors, tau(b), gives n.

Table of values

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

List of values

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