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.

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

Table of values

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

List of values

[1, 1, 2, 0, 3, 2, 5, 0, 2, 3, 7, 0, 11, 5, 6, 0, 15, 2, 22, 0, 10, 7, 30, 0, 6, 11, 0, 0, 42, 6, 56, 0, 14, 15, 15, 0, 77, 22, 22, 0, 101, 10, 135, 0, 6, 30, 176, 0, 20, 6, 30, 0, 231, 0, 21, 0, 44, 42, 297, 0, 385, 56, 10, 0, 33, 14, 490, 0, 60, 15, 627, 0]