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.

A318670 Number of subsets of divisors of n whose least common multiple is n and the sum does not exceed n. For n > 1, 1 is excluded from the set of divisors.

Table of values

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

List of values

[1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 5, 1, 2, 2, 1, 1, 6, 1, 6, 2, 2, 1, 17, 1, 2, 1, 7, 1, 34, 1, 1, 2, 2, 2, 44, 1, 2, 2, 23, 1, 36, 1, 7, 7, 2, 1, 65, 1, 7, 2, 7, 1, 21, 2, 25, 2, 2, 1, 471, 1, 2, 7, 1, 2, 39, 1, 7, 2, 44, 1, 355, 1, 2, 7, 7, 2, 39, 1, 89, 1, 2, 1, 531, 2, 2, 2, 27, 1, 559, 2, 7, 2, 2, 2, 257, 1, 7, 7, 61, 1, 39, 1, 28, 46]