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.

A370645 Number of integer factorizations of n into unordered factors > 1 such that only one set can be obtained by choosing a different prime factor of each factor.

Table of values

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

List of values

[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 2, 1, 2, 1, 1, 1, 3, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 4, 1, 1, 1, 3, 1, 1, 1, 2, 2, 1, 1, 4, 1, 2, 1, 2, 1, 3, 1, 3, 1, 1, 1, 3, 1, 1, 2, 1, 1, 1, 1, 2, 1, 1, 1, 5, 1, 1, 2, 2, 1, 1, 1, 4, 1, 1, 1, 3, 1, 1, 1]