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.

A381453 Number of multisets that can be obtained by choosing a constant integer partition of each prime index of n and taking the multiset union.

Table of values

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

List of values

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