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.

A340034 a(n) is the number of ways to represent A025487(n) as a product of the largest possible number of distinct factors in the product.

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

List of values

[1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 2, 3, 1, 3, 4, 1, 1, 1, 1, 1, 1, 1, 3, 2, 2, 5, 2, 4, 4, 7, 3, 6, 1, 4, 1, 9, 7, 1, 1, 1, 1, 1, 1, 3, 7, 4, 2, 2, 3, 1, 6, 2, 1, 7, 3, 10, 1, 11, 5, 9, 7, 2, 17, 5, 5, 1, 9, 11, 1, 2, 10, 1, 1, 12, 1, 1, 14, 9, 3, 2, 10, 1, 4, 1]