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.

A355737 Number of ways to choose a sequence of divisors, one of each prime index of n (with multiplicity), such that the result has no common divisor > 1.

Table of values

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

List of values

[0, 1, 1, 1, 1, 2, 1, 1, 3, 2, 1, 2, 1, 3, 4, 1, 1, 4, 1, 2, 4, 2, 1, 2, 3, 4, 7, 3, 1, 4, 1, 1, 4, 2, 6, 4, 1, 4, 6, 2, 1, 6, 1, 2, 8, 3, 1, 2, 5, 4, 4, 4, 1, 8, 4, 3, 5, 4, 1, 4, 1, 2, 10, 1, 6, 4, 1, 2, 6, 6, 1, 4, 1, 6, 8, 4, 6, 8, 1, 2, 15, 2, 1, 6, 4, 4]