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.

A126131 a(n) = number of divisors of n which equal any d(k) for 1 <= k <= n, where d(k) is the number of positive divisors of k.

Table of values

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

List of values

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