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.

A066376 Number of [*]-divisors d <= n such that there is another [*]-divisor d' < n with d [*] d' = n.

Table of values

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

List of values

[0, 1, 1, 2, 1, 3, 2, 3, 1, 3, 1, 5, 1, 5, 4, 4, 1, 3, 1, 5, 2, 3, 1, 7, 1, 3, 3, 8, 1, 9, 7, 5, 1, 3, 1, 5, 1, 3, 1, 7, 1, 5, 1, 5, 3, 3, 3, 9, 1, 3, 3, 5, 1, 7, 3, 11, 1, 3, 3, 14, 3, 15, 13, 6, 1, 3, 1, 5, 1, 3, 1, 7, 2, 3, 1, 5, 1, 3, 1, 9, 1, 3, 1, 8, 4, 3, 1, 7, 1, 7, 3, 5, 1, 7, 5, 11, 1]