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.

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

Table of values

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

List of values

[1, 1, 2, 1, 3, 0, 5, 1, 2, 0, 7, 0, 11, 0, 0, 1, 15, 0, 22, 0, 0, 0, 30, 0, 3, 0, 2, 0, 42, 0, 56, 1, 0, 0, 0, 0, 77, 0, 0, 0, 101, 0, 135, 0, 0, 0, 176, 0, 5, 0, 0, 0, 231, 0, 0, 0, 0, 0, 297, 0, 385, 0, 0, 1, 0, 0, 490, 0, 0, 0, 627, 0, 792, 0, 0, 0, 0, 0]