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.

A355742 Number of ways to choose a sequence of prime-power divisors, one of each prime index of n. Product of bigomega over the prime indices of n, with multiplicity.

Table of values

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

List of values

[1, 0, 1, 0, 1, 0, 2, 0, 1, 0, 1, 0, 2, 0, 1, 0, 1, 0, 3, 0, 2, 0, 2, 0, 1, 0, 1, 0, 2, 0, 1, 0, 1, 0, 2, 0, 3, 0, 2, 0, 1, 0, 2, 0, 1, 0, 2, 0, 4, 0, 1, 0, 4, 0, 1, 0, 3, 0, 1, 0, 3, 0, 2, 0, 2, 0, 1, 0, 2, 0, 3, 0, 2, 0, 1, 0, 2, 0, 2, 0, 1, 0, 1, 0, 1, 0, 2]