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.

A092976 Consider all partitions of n into parts all of which are divisors of n; a(n) = number of distinct values taken by the product of the parts.

Table of values

n a(n)
0 1
1 1
2 2
3 2
4 3
5 2
6 7
7 2
8 5
9 4
10 10
11 2
12 19
13 2
14 13
15 13
16 9
17 2
18 37
19 2
20 29
21 17
22 19
23 2
24 61
25 6
26 22
27 10
28 39
29 2
30 247
31 2
32 17
33 25
34 28
35 25
36 127
37 2
38 31
39 29
40 97
41 2
42 450
43 2
44 59
45 82
46 37
47 2
48 217
49 8
50 146
51 37
52 69
53 2
54 271
55 37
56 133
57 41
58 46
59 2
60 1558
61 2
62 49
63 112
64 33
65 43
66 1038
67 2
68 89
69 49
70 1105
71 2
72 469
73 2
74 58
75 211
76 99
77 49
78 1423
79 2
80 353

List of values

[1, 1, 2, 2, 3, 2, 7, 2, 5, 4, 10, 2, 19, 2, 13, 13, 9, 2, 37, 2, 29, 17, 19, 2, 61, 6, 22, 10, 39, 2, 247, 2, 17, 25, 28, 25, 127, 2, 31, 29, 97, 2, 450, 2, 59, 82, 37, 2, 217, 8, 146, 37, 69, 2, 271, 37, 133, 41, 46, 2, 1558, 2, 49, 112, 33, 43, 1038, 2, 89, 49, 1105, 2, 469, 2, 58, 211, 99, 49, 1423, 2, 353]