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.

A387115 Number of ways to choose a sequence of distinct strict integer partitions, one of each prime index of n.

Table of values

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

List of values

[1, 1, 1, 0, 2, 1, 2, 0, 0, 2, 3, 0, 4, 2, 2, 0, 5, 0, 6, 0, 2, 3, 8, 0, 2, 4, 0, 0, 10, 2, 12, 0, 3, 5, 4, 0, 15, 6, 4, 0, 18, 2, 22, 0, 0, 8, 27, 0, 2, 2, 5, 0, 32, 0, 6, 0, 6, 10, 38, 0, 46, 12, 0, 0, 8, 3, 54, 0, 8, 4, 64, 0, 76, 15, 2, 0, 6, 4, 89, 0, 0]