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.

A381633 Number of ways to partition the prime indices of n into sets with distinct sums.

Table of values

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

List of values

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