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.

A355749 Number of ways to choose a weakly decreasing sequence of divisors, one of each prime index of n (with multiplicity, taken in weakly increasing order).

Table of values

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

List of values

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