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.

A387120 Number of ways to choose a different constant integer partition of each prime index of n.

Table of values

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

List of values

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