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.

A370816 Greatest number of multisets that can be obtained by choosing a divisor of each factor in an integer factorization of n into unordered factors > 1.

Table of values

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

List of values

[1, 2, 2, 3, 2, 4, 2, 5, 3, 4, 2, 7, 2, 4, 4, 7, 2, 7, 2, 7, 4, 4, 2, 11, 3, 4, 5, 7, 2, 8, 2, 10, 4, 4, 4, 12, 2, 4, 4, 11, 2, 8, 2, 7, 7, 4, 2, 17, 3, 7, 4, 7, 2, 11, 4, 11, 4, 4, 2, 15, 2, 4, 7, 14, 4, 8, 2, 7, 4, 8, 2, 20, 2, 4, 7, 7, 4, 8, 2, 17, 7, 4, 2]